Pages that link to "Item:Q3902542"
From MaRDI portal
The following pages link to The theory and computation of evolutionary distances: Pattern recognition (Q3902542):
Displaying 40 items.
- Very fast and simple approximate string matching (Q294703) (← links)
- Approximate all-pairs suffix/prefix overlaps (Q418172) (← links)
- A practical semi-external memory method for approximate pattern matching (Q529654) (← links)
- An efficient algorithm for sequence comparison with block reversals (Q596144) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- Faster approximate string matching for short patterns (Q692899) (← links)
- On optimal embeddings of metrics in graphs (Q794666) (← links)
- General methods of sequence comparison (Q799527) (← links)
- Algorithms for computing evolutionary similarity measures with length independent gap penalties (Q800252) (← links)
- Matching regular expressions on uncertain data (Q832529) (← links)
- Minimum message length encoding and the comparison of macromolecules (Q912791) (← links)
- Improved approximate string matching using compressed suffix data structures (Q930602) (← links)
- An algorithm with linear expected running time for string editing with substitutions and substring reversals (Q963370) (← links)
- The prediction of a protein and nucleic acid structure: Problems and prospects (Q1061043) (← links)
- Pattern recognition in genetic sequences by mismatch density (Q1070960) (← links)
- Stanislaw M. Ulam's contributions to theoretical biology (Q1072464) (← links)
- A nonlinear measure of subalignment similarity and its significance levels (Q1085099) (← links)
- On optimal realizations of finite metric spaces by graphs (Q1100481) (← links)
- Approximate matching of regular expressions (Q1119025) (← links)
- Comparison of biosequences (Q1167075) (← links)
- A time-efficient, linar-space local similarity algorithm (Q1189709) (← links)
- Approximate string-matching with \(q\)-grams and maximal matches (Q1190465) (← links)
- Sublinear approximate string matching and biological applications (Q1336963) (← links)
- A sublinear algorithm for approximate keyword searching (Q1336965) (← links)
- Algorithms for approximate graph matching (Q1357079) (← links)
- Improved approximate pattern matching on hypertext (Q1566744) (← links)
- Approximate string matching on Ziv--Lempel compressed text (Q1827277) (← links)
- Approximate pattern matching and transitive closure logics. (Q1874401) (← links)
- A subquadratic algorithm for approximate limited expression matching (Q1907030) (← links)
- A constrained edit distance between unordered labeled trees (Q1908261) (← links)
- A bit-string longest-common-subsequence algorithm (Q1996891) (← links)
- Extending alignments with \(k\)-mismatches and \(\ell\)-gaps (Q2437749) (← links)
- Average-case linear-time similar substring searching by the \(q\)-gram distance (Q2440164) (← links)
- Indexing text with approximate \(q\)-grams (Q2569395) (← links)
- Bit-parallel approximate string matching algorithms with transposition (Q2569398) (← links)
- VECTOR ALGORITHMS FOR APPROXIMATE STRING MATCHING (Q3021938) (← links)
- (Q3143775) (← links)
- (Q3165665) (← links)
- A Note on Optimal and Suboptimal Digraph Realizations of Quasidistance Matrices (Q3320428) (← links)
- (Q5091741) (← links)
