Pages that link to "Item:Q2264770"
From MaRDI portal
The following pages link to An algorithm for the distance between two finite sequences (Q2264770):
Displaying 17 items.
- Nested wreath groups and their applications to phylogeny in biology and Cayley trees in chemistry and physics (Q511901) (← links)
- Computing a longest common subsequence for a set of strings (Q786541) (← links)
- General methods of sequence comparison (Q799527) (← links)
- Automatic error correction in flexion languages (Q805262) (← links)
- A small trip in the untranquil world of genomes: a survey on the detection and analysis of genome rearrangement breakpoints (Q932313) (← links)
- Stanislaw Ulam: The warmth and brilliance of an eclectic mind (Q1068808) (← links)
- Pattern recognition in genetic sequences by mismatch density (Q1070960) (← links)
- Stanislaw M. Ulam's contributions to theoretical biology (Q1072464) (← links)
- New algorithms for the LCS problem (Q1072704) (← links)
- The alignment of protein structures in three dimensions (Q1111963) (← links)
- A taxonomic distance applicable to paleontology (Q1137336) (← links)
- The string merging problem (Q1154285) (← links)
- A fast algorithm for the longest-common-subsequence problem (Q1155365) (← links)
- A survey of multiple sequence comparison methods (Q1191624) (← links)
- Lazy dynamic-programming can be eager (Q1199883) (← links)
- Some limit results for longest common subsequences (Q1256321) (← links)
- Using Hirschberg's algorithm to generate random alignments of strings (Q1336757) (← links)
