The theory and computation of evolutionary distances: Pattern recognition
From MaRDI portal
Publication:3902542
DOI10.1016/0196-6774(80)90016-4zbMath0454.68110OpenAlexW1990413869WikidataQ29014251 ScholiaQ29014251MaRDI QIDQ3902542
Publication date: 1980
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(80)90016-4
dynamic programming algorithmgenetic sequencesevolutionary distancessimilarities between two sequences
Dynamic programming (90C39) Pattern recognition, speech recognition (68T10) Genetics and epigenetics (92D10)
Related Items
Approximate pattern matching and transitive closure logics., A nonlinear measure of subalignment similarity and its significance levels, Sublinear approximate string matching and biological applications, A sublinear algorithm for approximate keyword searching, Matching regular expressions on uncertain data, New and faster filters for multiple approximate string matching, Very fast and simple approximate string matching, Boyer-Moore approach to approximate string matching, On optimal realizations of finite metric spaces by graphs, On-Line Approximate String Searching Algorithms: Survey and Experimental Results, Algorithms for approximate graph matching, A subquadratic algorithm for approximate limited expression matching, A constrained edit distance between unordered labeled trees, An efficient algorithm for sequence comparison with block reversals, Approximate matching of regular expressions, On locally optimal alignments in genetic sequences, Multiple approximate string matching, A Probabilistic Analysis of a String Editing Problem and its Variations, Approximate all-pairs suffix/prefix overlaps, Extending alignments with \(k\)-mismatches and \(\ell\)-gaps, Minimum message length encoding and the comparison of macromolecules, Average-case linear-time similar substring searching by the \(q\)-gram distance, Comparison of biosequences, Improved approximate string matching using compressed suffix data structures, A time-efficient, linar-space local similarity algorithm, Approximate string-matching with \(q\)-grams and maximal matches, A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices, VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING, A bit-string longest-common-subsequence algorithm, Approximate string matching with suffix automata, A practical semi-external memory method for approximate pattern matching, Faster approximate string matching for short patterns, An algorithm with linear expected running time for string editing with substitutions and substring reversals, Unnamed Item, Unnamed Item, Unnamed Item, Periodic String Comparison, Improved approximate pattern matching on hypertext, Approximate string matching on Ziv--Lempel compressed text, Indexing text with approximate \(q\)-grams, Bit-parallel approximate string matching algorithms with transposition, On optimal embeddings of metrics in graphs, Random Access to Grammar-Compressed Strings and Trees, General methods of sequence comparison, Algorithms for computing evolutionary similarity measures with length independent gap penalties, The prediction of a protein and nucleic acid structure: Problems and prospects, Pattern recognition in genetic sequences by mismatch density, Stanislaw M. Ulam's contributions to theoretical biology
