Comparison of strings belonging to the same family
From MaRDI portal
Publication:1818790
DOI10.1016/S0020-0255(97)10039-1zbMath0951.68181MaRDI QIDQ1818790
Publication date: 4 January 2000
Published in: Information Sciences (Search for Journal in Brave)
Related Items (2)
Convex hull analysis of evolutionary and phylogenetic relationships between biological groups ⋮ An artificial neural network based approach for online string matching/filtering of large databases
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- General methods of sequence comparison
- The computational complexity of inferring rooted phylogenies by parsimony
- Some biological sequence metrics
- A molecular sequence metric and evolutionary trees
- Trees, Stars, and Multiple Biological Sequence Alignment
- Data compression
- A linear space algorithm for computing maximal common subsequences
- Minimal Mutation Trees of Sequences
- A Clustering Procedure for Syntactic Patterns
- The Complexity of Some Problems on Subsequences and Supersequences
- Dynamic programming algorithm optimization for spoken word recognition
- Algorithms for the Longest Common Subsequence Problem
- The String-to-String Correction Problem
- Spelling correction in systems programs
- Efficient algorithms for inferring evolutionary trees
This page was built for publication: Comparison of strings belonging to the same family
