A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences
From MaRDI portal
Publication:1861731
DOI10.1016/S0893-9659(01)00085-4zbMath1015.92013WikidataQ127740538 ScholiaQ127740538MaRDI QIDQ1861731
Publication date: 10 March 2003
Published in: Applied Mathematics Letters (Search for Journal in Brave)
90C39: Dynamic programming
92C40: Biochemistry, molecular biology
65Y20: Complexity and performance of numerical algorithms
92-08: Computational methods for problems pertaining to biology
Related Items
Fuzzy polynucleotide spaces and metrics, A metric space to study differences between polynucleotides, A study of entropy/clarity of genetic sequences using metric spaces and fuzzy sets, Co-linear chaining with overlaps and gap costs, An extension of fuzzy topological approach for comparison of genetic sequences
Uses Software
Cites Work
- Unnamed Item
- A polyhedral approach to sequence alignment problems
- Linear-space algorithms that build local alignments from fragments
- A linear space algorithm for computing maximal common subsequences
- Sparse dynamic programming I
- Multiple DNA and protein sequence alignment based on segment-to-segment comparison.