A time-efficient, linar-space local similarity algorithm
From MaRDI portal
Publication:1189709
DOI10.1016/0196-8858(91)90017-DzbMATH Open0748.90079WikidataQ107138276 ScholiaQ107138276MaRDI QIDQ1189709FDOQ1189709
Publication date: 27 September 1992
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Recommendations
- Linear-space algorithms that build local alignments from fragments
- Fast Algorithms for Local Similarity Queries in Two Sequences
- Locally optimal subalignments using nonlinear similarity functions
- scientific article; zbMATH DE number 5171901
- FastLSA: A fast, linear-space, parallel and sequential algorithm for sequence alignment
Applications of mathematical programming (90C90) Protein sequences, DNA sequences (92D20) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- On the computational power of pushdown automata
- Self-adjusting binary search trees
- A linear space algorithm for computing maximal common subsequences
- The theory and computation of evolutionary distances: Pattern recognition
- Approximate matching of regular expressions
- Title not available (Why is that?)
- Pattern recognition in genetic sequences by mismatch density
Cited In (21)
- Sensitivity analysis and efficient method for identifying optimal spaced seeds
- FastLSA: A fast, linear-space, parallel and sequential algorithm for sequence alignment
- Title not available (Why is that?)
- Computing and Combinatorics
- On spaced seeds for similarity search
- The ribosome as a missing link in the evolution of life
- An efficient alignment algorithm for masked sequences
- A technique to find multiple motif occurrences in a biomolecular sequence
- Fast Algorithms for Local Similarity Queries in Two Sequences
- Efficient algorithms for local alignment search
- Efficient algorithms for similarity search
- Linear-space algorithms that build local alignments from fragments
- Local multiple alignment via subgraph enumeration
- Block edit models for approximate string matching
- Efficient bottom-up hybrid hierarchical clustering techniques for protein sequence classification
- APPROXIMATION ALGORITHMS FOR LOCAL ALIGNMENT WITH LENGTH CONSTRAINTS
- Elucidating the protein cold-adaptation: investigation of the parameters enhancing protein psychrophilicity
- Constrained sequence alignment
- Computing similarity of run-length encoded strings with affine gap penalty
- BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS
- Locally optimal subalignments using nonlinear similarity functions
This page was built for publication: A time-efficient, linar-space local similarity algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1189709)
