An algorithm for the distance between two finite sequences

DOI10.1016/0097-3165(74)90050-8zbMath0273.05015OpenAlexW2062112417MaRDI QIDQ2264770

Peter H. Sellers

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(74)90050-8

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) General biology and biomathematics (92B05)

Related Items (22)

A common basis for similarity measures involving two strings† ⋮ AStarix: Fast and Optimal Sequence-to-Graph Alignment ⋮ Using Hirschberg's algorithm to generate random alignments of strings ⋮ The alignment of protein structures in three dimensions ⋮ A taxonomic distance applicable to paleontology ⋮ Calcul de la distance par les sous-mots ⋮ The string merging problem ⋮ A fast algorithm for the longest-common-subsequence problem ⋮ Locating the vertices of a steiner tree in an arbitrary metric space ⋮ A small trip in the untranquil world of genomes: a survey on the detection and analysis of genome rearrangement breakpoints ⋮ A survey of multiple sequence comparison methods ⋮ Nested wreath groups and their applications to phylogeny in biology and Cayley trees in chemistry and physics ⋮ SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY ⋮ Lazy dynamic-programming can be eager ⋮ Some limit results for longest common subsequences ⋮ Computing a longest common subsequence for a set of strings ⋮ General methods of sequence comparison ⋮ Automatic error correction in flexion languages ⋮ Stanislaw Ulam: The warmth and brilliance of an eclectic mind ⋮ Pattern recognition in genetic sequences by mismatch density ⋮ Stanislaw M. Ulam's contributions to theoretical biology ⋮ New algorithms for the LCS problem

Cites Work

• Matching Sequences under Deletion/Insertion Constraints

This page was built for publication: An algorithm for the distance between two finite sequences