MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

An Algorithm for Approximate Tandem Repeats (1993) [60 citations — 1 self]

by Gad M. Landau ,  Jeanette P. Schmidt ,  Dina Sokol ,  Incyte Pharmaceuticals
In Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching (CPM), volume 684 of Lecture Notes in Computer Science
Add To MetaCart

Abstract:

A perfect single tandem repeat is defined as a nonempty string that can be divided into two identical substrings, e.g. abcabc. An approximate single tandem repeat is one in which the substrings are similar, but not identical, e.g. abcdaacd.

Citations

2010 The Design and Analysis of Computer Algorithms – Aho, Hopcroft, et al. - 1974
730 A general method applicable to the search for similarities in the amino acid sequence of two proteins – Needleman, Wunsch - 1970
630 Algorithms on Strings, Trees and Sequences – Gusfield - 1997
553 Binary codes capable of correcting deletions, insertions and reversals – Levenshtein - 1966
457 Fast pattern matching in strings – Knuth, Morris, et al. - 1977
154 Introduction to Computational Molecular Biology – Meidanis, Setubal - 1997
140 Algorithms for approximate string matching – Ukkonen - 1985
112 Tandem repeats finder: a program to analyze DNA sequences. Nucleic Acids Res 1999, 27:573-580. Page 5 of 6 (page number not for citation purposes) Genomics 2004 – Benson
87 Fast parallel and serial approximate string matching – Landau, Vishkin - 1989
57 An O(n log n) algorithm for finding all repetitions in a string – MAIN, LORENTZ - 1984
44 Fast string matching with k differences – Landau, Vishkin - 1988
30 All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings – Schmidt - 1998
29 Efficient string matching with k mismatches – Landau, Vishkin - 1986
27 Incremental string comparison – Landau, Myers, et al. - 1998
23 A method for fast database search for all k-nucleotide repeats – Benson, Waterman - 1994
17 An algorithm for locating nonoverlapping regions of maximum alignment score – Kannan, Myers - 1993
15 Sequence alignment with tandem duplication – Benson - 1997
10 Optimal Parallel Detection of Squares in Strings – Apostolico - 1992
7 Computational molecular biology – Lesk - 1988
6 Linear time recognition of square free strings – Main, Lorentz - 1985
6 The complete 685-kilobase DNA sequence of the human beta T cell receptor locus – Rowan, Koop, et al. - 1996
6 Algorithms on Strings, Trees, and Sequences – Guseld - 1997
5 W.F.: Approximate periods of strings – Sim, Iliopoulos, et al. - 2001
4 Searching through sequence databases – Doolittle - 1990
4 An O(n log n) algorithm for nding all repetitions in a string – Main, Lorentz - 1984
3 Caskey et al. An unstable triplet repeat in a gene related to Myotonic Dystrophy – T - 1992
3 On the distribution of k-tuple matches for sequence homology: A constant time-exact calculation of the variance – Benson, Su - 1998
2 A space-efficient algorithm for finding best scoring non-overlapping alignments – Benson - 1995
1 On the distribution of k tuple matches for sequence homology: a constant time-exact calculation of the variance – Benson, Su - 1998
1 An algorithm for locating a repeated region – Miller - 1992
1 A space-ef#cient algorithm for #nding best scoring non-overlapping alignments. Theoret – Benson - 1995
1 Tandem repeats #nder---a program to analyze DNA sequences – Benson - 1999
1 An unstable triplet repeat in a gene related to Myotonic Dystrophy – Caskey - 1992
1 An algorithm for locating a repeated region. (manuscript – Miller - 1992
View or Download | Add to My Collection | Correct Errors