Matching Sequences under Deletion/Insertion Constraints
From MaRDI portal
Publication:5644001
DOI10.1073/pnas.69.1.4zbMath0235.05013WikidataQ24562804 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
05B99: Designs and configurations
Related Items
A survey of multiple sequence comparison methods, Matching code sequences utilizing context free quality measures, Some biological sequence metrics, The tree-to-tree editing problem, The parameterized complexity of sequence alignment and consensus, Approximate regular expression pattern matching with concave gap penalties, Super-pattern matching, A molecular sequence metric and evolutionary trees, An algorithm for the distance between two finite sequences, Shortcuts, diversions, and maximal chains in partially ordered sets, SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY