메뉴 건너뛰기




Volumn 151, Issue 1-3, 2005, Pages 5-20

Optimal discovery of repetitions in 2D

Author keywords

2D array; Design and analysis of algorithms; Pattern discovery; Pattern matching; Tandem repetition

Indexed keywords

2D ARRAYS; DESIGN AND ANALYSIS OF ALGORITHMS; PATTERN DISCOVERY; TANDEM REPETITION;

EID: 24944571739     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.02.019     Document Type: Conference Paper
Times cited : (13)

References (26)
  • 2
    • 0028407990 scopus 로고
    • An alphabet independent approach to two-dimensional pattern matching
    • A. Amir, G. Benson, and M. Farach An alphabet independent approach to two-dimensional pattern matching SIAM J. Comput. 23 2 1994 313 323
    • (1994) SIAM J. Comput. , vol.23 , Issue.2 , pp. 313-323
    • Amir, A.1    Benson, G.2    Farach, M.3
  • 3
    • 52449148332 scopus 로고
    • Optimal parallel detection of squares in strings
    • A. Apostolico Optimal parallel detection of squares in strings Algorithmica 8 1992 285 319
    • (1992) Algorithmica , vol.8 , pp. 285-319
    • Apostolico, A.1
  • 4
    • 0001531298 scopus 로고    scopus 로고
    • An optimal O (log log n) time parallel algorithm for detecting all squares in strings
    • A. Apostolico, and D. Breslauer An optimal O (log log n ) time parallel algorithm for detecting all squares in strings SIAM J. Comput. 25 6 1996 1318 1331
    • (1996) SIAM J. Comput. , vol.25 , Issue.6 , pp. 1318-1331
    • Apostolico, A.1    Breslauer, D.2
  • 5
    • 0007550002 scopus 로고    scopus 로고
    • Fibonacci arrays and their two-dimensional repetitions
    • A. Apostolico, and V.E. Brimkov Fibonacci arrays and their two-dimensional repetitions Theoret. Comput. Sci. 237 2000 263 273
    • (2000) Theoret. Comput. Sci. , vol.237 , pp. 263-273
    • Apostolico, A.1    Brimkov, V.E.2
  • 6
    • 49049125709 scopus 로고
    • Optimal off-line detection of repetitions in a string
    • A. Apostolico, and F.P. Preparata Optimal off-line detection of repetitions in a string Theoret. Comput. Sci. 22 1983 297 315
    • (1983) Theoret. Comput. Sci. , vol.22 , pp. 297-315
    • Apostolico, A.1    Preparata, F.P.2
  • 7
    • 0022240822 scopus 로고
    • Structural properties of the string statistic problem
    • A. Apostolico, and F.P. Preparata Structural properties of the string statistic problem J. Comput. Systems 31 3 1985 394 411
    • (1985) J. Comput. Systems , vol.31 , Issue.3 , pp. 394-411
    • Apostolico, A.1    Preparata, F.P.2
  • 8
    • 0001778271 scopus 로고    scopus 로고
    • Tilings and rotations on the torus: A two-dimensional generalization of Sturmian words
    • V. Berthé, and L. Vuillon Tilings and rotations on the torus: a two-dimensional generalization of Sturmian words Discrete Math. 223 2000 27 53
    • (2000) Discrete Math. , vol.223 , pp. 27-53
    • Berthé, V.1    Vuillon, L.2
  • 9
    • 0035516675 scopus 로고    scopus 로고
    • Optimally fast CRCW-PRAM testing 2D-arrays for existence of repetitive patterns
    • V.E. Brimkov Optimally fast CRCW-PRAM testing 2D-arrays for existence of repetitive patterns Internat. J. Pattern Recognition Artif. Intell. 15 7 2001 1167 1182
    • (2001) Internat. J. Pattern Recognition Artif. Intell. , vol.15 , Issue.7 , pp. 1167-1182
    • Brimkov, V.E.1
  • 10
    • 24944516881 scopus 로고    scopus 로고
    • Optimal parallel searching an array for certain repetitions
    • V.E. Brimkov Optimal parallel searching an array for certain repetitions E.N. Discrete Math. 12 2003 http://www.elsevier.nl/gej-ng/31/29/24/show/ Products/notes/contents.htt
    • (2003) E.N. Discrete Math. , vol.12
    • Brimkov, V.E.1
  • 11
    • 14744295242 scopus 로고    scopus 로고
    • Plane digitization and related combinatorial problems
    • V.E. Brimkov, and R.P. Barneva Plane digitization and related combinatorial problems Discrete Appl. Math. 147 2005 169 186
    • (2005) Discrete Appl. Math. , vol.147 , pp. 169-186
    • Brimkov, V.E.1    Barneva, R.P.2
  • 12
    • 14744303499 scopus 로고    scopus 로고
    • CITR-TR-120, University of Auckland, New Zealand
    • see also: V.E. Brimkov, Digital flatness and related combinatorial problems, CITR-TR-120, University of Auckland, New Zealand, 2002 45pp., http://www.citr.auckland.ac.nz/techreports/?year=2002.
    • (2002) Digital Flatness and Related Combinatorial Problems
    • Brimkov, V.E.1
  • 13
    • 0000388729 scopus 로고    scopus 로고
    • Two-dimensional sequences of complexity mn + 1
    • J. Cassaigne Two-dimensional sequences of complexity mn + 1 J. Automatic Language Combin. 4 1999 153 170
    • (1999) J. Automatic Language Combin. , vol.4 , pp. 153-170
    • Cassaigne, J.1
  • 15
    • 0001444363 scopus 로고
    • An optimal algorithm for computing the repetitions in a word
    • M. Crochemore An optimal algorithm for computing the repetitions in a word Inform. Process. Lett. 12 5 1981 244 250
    • (1981) Inform. Process. Lett. , vol.12 , Issue.5 , pp. 244-250
    • Crochemore, M.1
  • 16
  • 20
    • 0001338917 scopus 로고
    • An O (n log n) algorithm for finding all repetitions in a string
    • G.M. Main, and R.J. Lorentz An O (n log n ) algorithm for finding all repetitions in a string J. Algorithms 5 1984 422 432
    • (1984) J. Algorithms , vol.5 , pp. 422-432
    • Main, G.M.1    Lorentz, R.J.2
  • 21
    • 0001788272 scopus 로고
    • Symbolic dynamics II: Sturmian sequences
    • M. Morse, and G.A. Hedlund Symbolic dynamics II: Sturmian sequences Amer. J. Math. 61 1940 1 42
    • (1940) Amer. J. Math. , vol.61 , pp. 1-42
    • Morse, M.1    Hedlund, G.A.2
  • 25
    • 0022142469 scopus 로고
    • Optimal parallel pattern matching in strings
    • U. Vishkin Optimal parallel pattern matching in strings Inform. Control 67 1985 91 113
    • (1985) Inform. Control , vol.67 , pp. 91-113
    • Vishkin, U.1
  • 26
    • 0001197301 scopus 로고    scopus 로고
    • Local configurations in a discrete plane
    • L. Vuillon Local configurations in a discrete plane Bull. Belgium Math. Soc. 6 1999 625 636
    • (1999) Bull. Belgium Math. Soc. , vol.6 , pp. 625-636
    • Vuillon, L.1


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