[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Bilu et al., 2006 - Google Patents

Faster algorithms for optimal multiple sequence alignment based on pairwise comparisons

Bilu et al., 2006

View PDF
Document ID
9497968504037574728
Author
Bilu Y
Agarwal P
Kolodny R
Publication year
Publication venue
IEEE/ACM Transactions on Computational Biology and Bioinformatics

External Links

Snippet

Multiple sequence alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal alignment, based on dynamic programming, increases exponentially with the …
Continue reading at users.cs.duke.edu (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
    • G06F19/22—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology for sequence comparison involving nucleotides or amino acids, e.g. homology search, motif or SNP [Single-Nucleotide Polymorphism] discovery or sequence alignment
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
    • G06F19/28—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology for programming tools or database systems, e.g. ontologies, heterogeneous data integration, data warehousing or computing architectures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
    • G06F19/16—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology for molecular structure, e.g. structure alignment, structural or functional relations, protein folding, domain topologies, drug targeting using structure data, involving two-dimensional or three-dimensional structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
    • G06F19/24—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology for machine learning, data mining or biostatistics, e.g. pattern finding, knowledge discovery, rule extraction, correlation, clustering or classification
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
    • G06F19/70—Chemoinformatics, i.e. data processing methods or systems for the retrieval, analysis, visualisation, or storage of physicochemical or structural data of chemical compounds
    • G06F19/708—Chemoinformatics, i.e. data processing methods or systems for the retrieval, analysis, visualisation, or storage of physicochemical or structural data of chemical compounds for data visualisation, e.g. molecular structure representations, graphics generation, display of maps or networks or other visual representations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/20—Handling natural language data
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
    • G06K9/62—Methods or arrangements for recognition using electronic means
    • G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring

Similar Documents

Publication Publication Date Title
US20240096450A1 (en) Systems and methods for adaptive local alignment for graph genomes
Jain et al. A fast approximate algorithm for mapping long reads to large reference databases
Vaser et al. Fast and accurate de novo genome assembly from long uncorrected reads
Sahraeian et al. SMETANA: accurate and scalable algorithm for probabilistic alignment of large-scale biological networks
Chaisson et al. Mapping single molecule sequencing reads using basic local alignment with successive refinement (BLASR): application and theory
S. Schwartz et al. Multiple alignment by sequence annealing
Yu et al. Protein function prediction using multilabel ensemble classification
Narayanan et al. Comparing protein interaction networks via a graph match-and-split algorithm
Almirantis et al. On avoided words, absent words, and their application to biological sequence analysis
Li et al. Protein inter‐residue contact and distance prediction by coupling complementary coevolution features with deep residual networks in CASP14
Sarkar et al. An algorithm for DNA read alignment on quantum accelerators
Abaka et al. CAMPways: constrained alignment framework for the comparative analysis of a pair of metabolic pathways
Bilu et al. Faster algorithms for optimal multiple sequence alignment based on pairwise comparisons
Joudaki et al. Aligning distant sequences to graphs using long seed sketches
Hunkler et al. Fast conformational clustering of extensive molecular dynamics simulation data
Berkemer et al. Compositional properties of alignments
Jain et al. Algorithms for colinear chaining with overlaps and gap costs
Hamada et al. Generalized centroid estimators in bioinformatics
Võ Phúc On the dimensions of the graded space 𝔽 2⊗ 𝒜 𝔽 2 [x 1, x 2,…, xs] at degrees s+ 5 and its relation to algebraic transfers
Vaddadi et al. Read mapping on genome variation graphs
Liu et al. A method for rapid similarity analysis of RNA secondary structures
Zhao et al. PSAEC: an improved algorithm for short read error correction using partial suffix arrays
Cavattoni et al. Classgraph: improving metagenomic read classification with overlap graphs
Kruspe et al. Progressive multiple sequence alignments from triplets
Tahir et al. Review of genome sequence short read error correction algorithms