SCOPUS 정보 검색 플랫폼

Theoretical Computer Science

Volumn 270, Issue 1-2, 2002, Pages 843-856

Simple and flexible detection of contiguous repeats using a suffix tree

(2) Stoye, Jens a,b Gusfield, Dan a

a UNIVERSITY OF CALIFORNIA (United States)

b MAX PLANCK INSTITUTE FOR MOLECULAR GENETICS (Germany)

Author keywords

Repeats; Sequence analysis; Suffix tree; Tandem arrays; Tandem repeats

Indexed keywords

ALGORITHMS; DATA STRUCTURES; PROBLEM SOLVING;

SPACE-OPTIMAL ALGORITHMS;

TREES (MATHEMATICS);

EID: 0037028427 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(01)00121-9 Document Type: Article

Times cited : (59)

References (34)

1
- 0002139526
- The myriad virtues of subword trees
- A. Apostolico, Z. Galil (Eds.), Springer, Berlin
- (1985) Combinatorial Algorithms on Words, vol. F12 of NATO ASI Series , vol.F12 , pp. 85-96
- Apostolico, A.¹

2
- 49049125709
- Optimal off-line detection of repetitions in a string
- (1983) Theoret. Comput. Sci. , vol.22 , pp. 297-315
- Apostolico, A.¹ Preparata, F.P.²

3
- 0031659403
- Sequence and transcriptional analysis of terminal regions of the fowl adenovirus type 8 genome
- (1998) J. Gen. Virol. , vol.79 , Issue.PART10 , pp. 2507-2516
- Cao, J.X.¹ Krell, P.J.² Nagy, E.³

4
- 0001444363
- An optimal algorithm for computing the repetitions in a word
- (1981) Inform. Process. Lett. , vol.12 , Issue.5 , pp. 244-250
- Crochemore, M.¹

5
- 0006893225
- Periodic prefixes in texts
- R. Capocelli, A. De Santis, U. Vaccaro (Eds.), Springer, Berlin
- (1993) Sequences II , pp. 153-165
- Crochemore, M.¹ Rytter, W.²

6
- 0004189992
- Oxford University Press, New York, NY
- (1994) Text Algorithms
- Crochemore, M.¹ Rytter, W.²

7
- 0000578664
- Squares, cubes, and time-space efficient string searching
- (1995) Algorithmica , vol.13 , Issue.5 , pp. 405-425
- Crochemore, M.¹ Rytter, W.²

8
- 0031381052
- Optimal suffix tree construction with large alphabets
- IEEE Press, New York, NY
- (1997) Proc. 38th Ann. Symp. on Foundations of Computer Science, FOCS 97 , pp. 137-143
- Farach, M.¹

9
- 0006931770
- How many squares can a string contain?
- (1998) J. Combin. Theory Ser. A , vol.82 , pp. 112-120
- Fraenkel, A.S.¹ Simpson, J.²

10
- 0006937138
- The exact number of squares in Fibonacci words
- (1999) Theoret. Comput. Sci. , vol.218 , Issue.1 , pp. 95-106
- Fraenkel, A.S.¹ Simpson, J.²

11
- 0006936860
- How many squares must a binary sequence contain?
- (1995) Electron. J. Combin. , vol.2 , Issue.R2 , pp. 1-9
- Fraenkel, A.S.¹ Simpson, R.J.²

12
- 0004137004
- Cambridge University Press, New York, NY
- (1997) Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology
- Gusfield, D.¹

13
- 0006936288
- Report CSE-98-4, Department of Computer Science, University of California, Davis
- (1998) Linear time algorithms for finding and representing all the tandem repeats in a string
- Gusfield, D.¹ Stoye, J.²

14
- 0031074030
- A characterization of the squares in a Fibonacci string
- (1997) Theoret. Comput. Sci. , vol.172 , Issue.1-2 , pp. 281-291
- Iliopoulos, C.S.¹ Moore, D.² Smyth, W.F.³

15
- 0006936289
- Personal communication
- Irving, R.W.¹

16
- 0033335475
- Finding maximal repetitions in a word in linear time
- IEEE Press, New York
- (1999) Proc. 40th Annu. Symp. on Foundations of Computer Science FOCS 99 , pp. 596-604
- Kolpakov, R.¹ Kucherov, G.²

17
- 84956858781
- On maximal repetitions in words
- G. Ciobanu, G. Paun (Eds.), Proc. 12th Int. Symp. on Fundamentals of Computation Theory, FCT 99, Springer, Berlin
- (1999) Lecture Notes in Computer Science , vol.1684 , pp. 374-385
- Kolpakov, R.¹ Kucherov, G.²

18
- 4244098734
- Technical Report 99-R-034, LORIA, France
- (1999) On the sum of exponents of maximal repetitions in a word
- Kolpakov, R.¹ Kucherov, G.²

19
- 85026771655
- Computation of squares in a string
- M. Crochemore, D. Gusfield (Eds.), Proc. Fifth Ann. Symp. on Combinatorial Pattern Matching, CPM 94, Springer, Berlin
- (1994) Lecture Notes in Computer Science , vol.807 , pp. 146-150
- Kosaraju, S.R.¹

20
- 0033066718
- REPuter: Fast computation of maximal repeats in complete genomes
- (1999) Bioinformatics , vol.15 , Issue.5 , pp. 426-427
- Kurtz, S.¹ Schleiermacher, C.²

21
- 0006936862
- Personal communication
- Landau, G.M.¹

22
- 34748868569
- An algorithm for approximate tandem repeats
- A. Apostolico, M. Crochemore, Z. Galil, U. Manber (Eds.), Proc. Fourth Ann. Symp. on Combinatorial Pattern Matching, CPM 93, Springer, Berlin
- (1993) Lecture Notes in Computer Science , vol.684 , pp. 120-133
- Landau, G.M.¹ Schmidt, J.P.²

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

24
- 0006886838
- Linear time recognition of squarefree strings
- A. Apostolico, Z. Galil (Eds.), Springer, Berlin
- (1985) Combinatorial Algorithms on Words, vol. F12 of NATO ASI Series , vol.F12 , pp. 271-278
- Main, M.G.¹ Lorentz, R.J.²

25
- 0027681165
- Suffix arrays: A new method for on-line search
- (1993) SIAM J. Comput. , vol.22 , pp. 935-948
- Manber, U.¹ Myers, E.W.²

26
- 0021101102
- An efficient method for finding repeats in molecular sequences
- (1983) Nucleic Acids Res. , vol.11 , Issue.13 , pp. 4629-4634
- Martinez, H.M.¹

27
- 0016942292
- A space-economical suffix tree construction algorithm
- (1976) J. Assoc. Comput. Mach. , vol.23 , Issue.2 , pp. 262-272
- McCreight, E.M.¹

28
- 0006937139
- Personal communication
- Schmidt, J.P.¹

29
- 0006975258
- Ph. D. Dissertation, Department of Computer Science, University of California, Davis
- (1995) Applications of Combinatorial Analysis to Repetitions in Strings, Phylogeny, and Parallel Multiplier Design
- Stelling, P.F.¹

30
- 84877356901
- Simple and flexible detection of contiguous repeats using a suffix tree
- M. Farach (Ed.), Proc. 9th Ann. Symp. on Combinatorial Pattern Matching, CPM 98, Springer, Berlin
- (1998) Lecture Notes in Computer Science , vol.1448 , pp. 140-152
- Stoye, J.¹ Gusfield, D.²

31
- 0032775704
- Elucidating sequence codes: Three codes for evolution
- (1999) Ann. N. Y. Acad. Sci. , vol.870 , pp. 330-338
- Trifonov, E.N.¹

32
- 0032613145
- Time and memory efficient algorithm for extracting palindromic and repetitive subsequences in nucleic acid sequences
- IEEE Press, New York
- (1999) Proc. Fourth Pacific Symp. on Biocomputing, PSB 99 , pp. 202-213
- Tsunoda, T.¹ Fukagawa, M.² Takagi, T.³

33
- 0001704377
- On-line construction of suffix trees
- (1995) Algorithmica , vol.14 , pp. 249-260
- Ukkonen, E.¹

34
- 85043482370
- Linear pattern matching algorithms
- IEEE Press, New York
- (1973) IEEE 14th Ann. Symp. on Switching and Automata Theory , pp. 1-11
- Weiner, P.¹

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