SCOPUS 정보 검색 플랫폼

Journal of Computational Biology

Volumn 8, Issue 1, 2001, Pages 1-18

An algorithm for approximate tandem repeats

(3) Landau, G M a,b Schmidt, J P c Sokol, D d

a UNIVERSITY OF HAIFA (Israel)

b POLYTECHNIC UNIVERSITY (United States)

c Experimental Station (United States)

d BAR ILAN UNIVERSITY (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DNA;

ACCURACY; ALGORITHM; ANALYTIC METHOD; ARTICLE; CHROMOSOME SIZE; COMPARATIVE STUDY; DISEASE ASSOCIATION; DNA DETERMINATION; GENE SEQUENCE; GENOME; MOLECULAR BIOLOGY; PRIORITY JOURNAL; TANDEM REPEAT;

ALGORITHMS; BASE SEQUENCE; HUMANS; MOLECULAR SEQUENCE DATA; RECEPTORS, ANTIGEN, T-CELL, ALPHA-BETA; REPETITIVE SEQUENCES, NUCLEIC ACID; TANDEM REPEAT SEQUENCES;

EID: 0034924152 PISSN: 10665277 EISSN: None Source Type: Journal
DOI: 10.1089/106652701300099038 Document Type: Article

Times cited : (126)

References (29)

1
- 0003415652
- Addison-Wesley, Reading, MA
- (1974) The Design and Analysis of Computer Algorithms
- Aho, A.V.¹ Hopcroft, J.E.² Ullman, J.D.³

2
- 52449148332
- Fast parallel detection of squares in strings
- (1992) Algorithmica , vol.8 , pp. 285-319
- Apostolico, A.¹

3
- 0004511957
- A space-efficient algorithm for finding best scoring non-overlapping alignments
- (1995) Theoret. Comput. Sci. , vol.145 , pp. 357-369
- Benson, G.¹

4
- 0030806210
- Sequence alignment with tandem duplication
- (1997) J. Comp. Biol. , vol.4 , pp. 351-367
- Benson, G.¹

5
- 0033555906
- Tandem repeats finder - A program to analyze DNA sequences
- (1999) Nucl. Acids Res. , vol.27 , pp. 573-580
- Benson, G.¹

6
- 0031923832
- On the distribution of k-tuple matches for sequence homology: A constant time-exact calculation of the variance
- (1998) J. Comp. Bio. , vol.5 , pp. 87-100
- Benson, G.¹ Su, X.²

7
- 0028104462
- A method for fast database search for all k-nucleotide repeats
- (1994) Nucl. Acids Res. , vol.22 , pp. 4828-4836
- Benson, G.¹ Waterman, M.²

8
- 0026598119
- An unstable triplet repeat in a gene related to Myotonic Dystrophy
- (1992) Science , vol.255 , pp. 1256-1258
- Caskey, C.T.¹

9
- 0025266744
- Searching through sequence databases
- (1990) Methods Enzymol. , vol.183 , pp. 99-110
- Doolittle, R.F.¹

10
- 0004137004
- Cambridge University Press
- (1997) Algorithms on Strings, Trees, and Sequences
- Gusfield, G.¹

11
- 84877315482
- An algorithm for locating nonoverlapping regions of maximum alignment score
- Lecture Notes in Computer Science, Springer-Verlag
- (1993) Proc. Fourth Combinatorial Pattern Matching Conference , vol.684 , pp. 74-86
- Kannan, S.K.¹ Myers, E.W.²

12
- 0004484243
- An algorithm for locating nonoverlapping regions of maximum alignment score
- (1996) SIAM J. Comput. , vol.25 , Issue.3 , pp. 648-662
- Kannan, S.K.¹ Myers, E.W.²

13
- 0000904908
- Fast pattern matching in strings
- (1977) SIAM J. Comput. , vol.6 , pp. 322-350
- Knuth, D.E.¹ Morris, J.H.² Pratt, V.R.³

14
- 0001282046
- Incremental string comparison
- (1998) SIAM J. Comput. , vol.27 , Issue.2 , pp. 557-582
- Landau, G.M.¹ Myers, E.W.² Schmidt, J.P.³

15
- 34748868569
- An algorithm for approximate tandem repeats
- Lecture Notes in Computer Science, Springer-Verlag
- (1993) Proc. Fourth Combinatorial Pattern Matching Conference , vol.684 , pp. 120-133
- Landau, G.M.¹ Schmidt, J.P.²

16
- 38249042384
- Efficient string matching with k mismatches
- (1986) Theoret. Comput. Sci. , vol.43 , pp. 239-249
- Landau, G.M.¹ Vishkin, U.²

17
- 0002193989
- Fast string matching with k differences
- (1988) JCSS , vol.37 , pp. 63-78
- Landau, G.M.¹ Vishkin, U.²

18
- 0001421462
- Fast parallel and serial approximate string matching
- (1989) J. Algorithms , vol.10 , Issue.2 , pp. 157-169
- Landau, G.M.¹ Vishkin, U.²

19
- 0038985985
- Oxford University Press
- (1989) Computational Molecular Biology
- Lesk, A.M.¹

20
- 0001116877
- Binary codes capable of correcting deletions, insertions, and reversals
- (1966) Soviet Phys. Dokl , vol.10 , pp. 707-710
- Levenshtein, V.I.¹

21
- 0001338917
- An O(n log n) algorithm for finding all repetitions in a string
- (1984) J. Algorithms , vol.5 , pp. 422-432
- Main, M.G.¹ Lorentz, R.J.²

22
- 0006886838
- Linear time recognition of square free strings
- NATO ASI Series, Series F: Computer and System Sciences, Springer-Verlag
- (1985) Combinatorial Algorithms on Words , vol.12 , pp. 272-278
- Main, M.G.¹ Lorentz, R.J.²

23
- 5844421858
- manuscript
- (1992) An algorithm for locating a repeated region
- Miller, W.¹

24
- 0014757386
- A general method applicable to the search for similarities in the amino acid sequences of two proteins
- (1970) J. Mol. Biol. , vol.48 , pp. 443-453
- Needleman, S.B.¹ Wunsch, C.D.²

25
- 0030017526
- The complete 685-kilobase DNA sequence of the human β T-cell receptor locus
- (1996) Science , vol.272 , pp. 1755-1768
- Rowan, L.¹ Koop, B.² Hood, L.³

26
- 0001596047
- All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings
- (1998) SIAM J. Comput. , vol.27 , Issue.4 , pp. 972-992
- Schmidt, J.P.¹

27
- 0004096390
- PWS Publishing Company
- (1997) Introduction to Computational Molecular Biology
- Setubal, J.¹ Meidanis, J.²

28
- 84957618969
- Approximate periods of strings
- Lecture Notes in Computer Science, Springer-Verlag
- (1999) Proc. Tenth Combinatorial Pattern Matching Conference , vol.1645 , pp. 123-133
- Sim, J.S.¹ Park, K.² Iliopoulos, C.S.³ Smyth, W.F.⁴

29
- 84983986619
- On approximate string matching
- Lecture Notes in Computer Science, Springer-Verlag
- (1983) Proc. Int. Conf. Found. Comp. Theor. , vol.158 , pp. 487-495
- Ukkonen, E.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.