A time-efficient, linear-space local similarity algorithm

Advances in Applied Mathematics

Volumn 12, Issue 3, 1991, Pages 337-357

  Huang, Xiaoqiu ^a   Miller, Webb ^b  

^a MICHIGAN TECHNOLOGICAL UNIVERSITY   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 44949272730     PISSN: 01968858     EISSN: 10902074     Source Type: Journal    
DOI: 10.1016/0196-8858(91)90017-D     Document Type: Article

References (15)

1. Pattern recognition in nucleic acid sequences I: A general method for finding local homologies and symmetries
2. An improved algorithm for matching biological sequences
3. A software tool for finding locally optimal alignments in protein and nucleic acid sequence
4. A linear space algorithm for computing maximal common subsequences
5. A space-efficient algorithm for local similarities
6. Optimal alignments in linear space
7. Approximate matching of regular expressions
8. Improved tools for biological sequence comparison
9. The theory and computation of evolutionary distances: pattern recognition
10. Pattern recognition in genetic sequences by mismatch density
11. Self-adjusting binary search trees
12. Identification of common molecular sequences
13. Sequence alignments
14. A new algorithm for best subsequence alignments with application to tRNA-rRNA comparisons