An algorithm for the distance between two finite sequences
From MaRDI portal
Cited in
(22)- General methods of sequence comparison
- Locating the vertices of a steiner tree in an arbitrary metric space
- Calcul de la distance par les sous-mots
- The alignment of protein structures in three dimensions
- A taxonomic distance applicable to paleontology
- A survey of multiple sequence comparison methods
- SYSTEM IDENTIFICATION, APPROXIMATION AND COMPLEXITY
- Some limit results for longest common subsequences
- A common basis for similarity measures involving two strings†
- New algorithms for the LCS problem
- Using Hirschberg's algorithm to generate random alignments of strings
- A small trip in the untranquil world of genomes: a survey on the detection and analysis of genome rearrangement breakpoints
- Computing a longest common subsequence for a set of strings
- Lazy dynamic-programming can be eager
- A fast algorithm for the longest-common-subsequence problem
- The string merging problem
- Stanislaw Ulam: The warmth and brilliance of an eclectic mind
- Nested wreath groups and their applications to phylogeny in biology and Cayley trees in chemistry and physics
- Automatic error correction in flexion languages
- Pattern recognition in genetic sequences by mismatch density
- Stanislaw M. Ulam's contributions to theoretical biology
- \textsc{AStarix}: fast and optimal sequence-to-graph alignment
This page was built for publication: An algorithm for the distance between two finite sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264770)
