Matching Sequences under Deletion/Insertion Constraints
From MaRDI portal
Publication:5644001
DOI10.1073/pnas.69.1.4zbMath0235.05013OpenAlexW2044966609WikidataQ24562804 ScholiaQ24562804MaRDI QIDQ5644001
Publication date: 1972
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.69.1.4
Related Items
Syntactic/semantic techniques in pattern recognition: A survey ⋮ Approximate regular expression pattern matching with concave gap penalties ⋮ Constrained string editing ⋮ Graph nodes and a definition of structural similarity ⋮ Super-pattern matching ⋮ The parameterized complexity of sequence alignment and consensus ⋮ Dynamic programming algorithms for picture comparison ⋮ Volume formula and growth rates of the balls of strings under the edit distances ⋮ Exact algorithms for the repetition-bounded longest common subsequence problem ⋮ The string merging problem ⋮ A fast algorithm for the longest-common-subsequence problem ⋮ Extending alignments with \(k\)-mismatches and \(\ell\)-gaps ⋮ Optimal sequence alignment allowing for long gaps ⋮ A note on some tree similarity measures ⋮ Geometric ergodicity of a Metropolis-Hastings algorithm for Bayesian inference of phylogenetic branch lengths ⋮ Distribution of the length of the longest common subsequence of two multi-state biological sequences ⋮ A survey of multiple sequence comparison methods ⋮ SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY ⋮ A molecular sequence metric and evolutionary trees ⋮ An algorithm for the distance between two finite sequences ⋮ Matching code sequences utilizing context free quality measures ⋮ LCS approximation via embedding into locally non-repetitive strings ⋮ SVM-BALSA: Remote homology detection based on Bayesian sequence alignment ⋮ Some biological sequence metrics ⋮ The tree-to-tree editing problem ⋮ LCS Approximation via Embedding into Local Non-repetitive Strings ⋮ Shortcuts, diversions, and maximal chains in partially ordered sets ⋮ Computing a longest common subsequence for a set of strings ⋮ General methods of sequence comparison ⋮ RNA secondary structures and their prediction ⋮ Line geometries for sequence comparisons ⋮ The prediction of a protein and nucleic acid structure: Problems and prospects ⋮ New algorithms for the LCS problem
