The theory and computation of evolutionary distances: Pattern recognition

DOI10.1016/0196-6774(80)90016-4MaRDI QIDQ3902542zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Peter H. Sellers

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

zbMATH Keywords

dynamic programming algorithmevolutionary distancesgenetic sequencessimilarities between two sequences

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Dynamic programming (90C39) Genetics and epigenetics (92D10)

Cited in

(50)

• 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
• A nonlinear measure of subalignment similarity and its significance levels
• On optimal realizations of finite metric spaces by graphs
• Approximate matching of regular expressions
• Comparison of biosequences
• A time-efficient, linar-space local similarity algorithm
• Approximate string-matching with q-grams and maximal matches
• Sublinear approximate string matching and biological applications
• A sublinear algorithm for approximate keyword searching
• Algorithms for approximate graph matching
• Improved approximate pattern matching on hypertext
• Approximate string matching on Ziv--Lempel compressed text
• Approximate pattern matching and transitive closure logics.
• A subquadratic algorithm for approximate limited expression matching
• A constrained edit distance between unordered labeled trees
• A bit-string longest-common-subsequence algorithm
• Extending alignments with k-mismatches and -gaps
• Average-case linear-time similar substring searching by the q-gram distance
• Indexing text with approximate \(q\)-grams
• Bit-parallel approximate string matching algorithms with transposition
• Very fast and simple approximate string matching
• VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING
• Dynamic programming for reduced NFAs for approximate string and sequence matching.
• The finite automata approaches in stringology
• A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices
• Periodic String Comparison
• Approximate all-pairs suffix/prefix overlaps
• New and faster filters for multiple approximate string matching
• On-Line Approximate String Searching Algorithms: Survey and Experimental Results
• A Probabilistic Analysis of a String Editing Problem and its Variations
• Boyer-Moore approach to approximate string matching
• Bounded-length Smith-Waterman alignment
• On locally optimal alignments in genetic sequences
• Multiple approximate string matching
• Random access to grammar-compressed strings and trees
• A practical semi-external memory method for approximate pattern matching
• An efficient algorithm for sequence comparison with block reversals
• Approximate string matching with suffix automata
• Approximate circular pattern matching under edit distance
• Faster approximate string matching for short patterns
• Bounded weighted edit distance: dynamic algorithms and matching lower bounds
• On optimal embeddings of metrics in graphs
• General methods of sequence comparison
• Algorithms for computing evolutionary similarity measures with length independent gap penalties
• Matching regular expressions on uncertain data
• Minimum message length encoding and the comparison of macromolecules
• Improved approximate string matching using compressed suffix data structures
• An algorithm with linear expected running time for string editing with substitutions and substring reversals

This page was built for publication: The theory and computation of evolutionary distances: Pattern recognition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3902542)