Faster index for property matching

Information Processing Letters

Volumn 105, Issue 6, 2008, Pages 218-223

  Iliopoulos, Costas S ^a   Rahman, M Sohel ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Algorithms; Combinatorial problems; Data structures; Pattern matching

Indexed keywords

COMBINATORIAL MATHEMATICS; DATA STRUCTURES; NUMBER THEORY; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

COMBINATORIAL PROBLEMS; SUFFIX ARRAYS;

PATTERN MATCHING;

EID: 38349109894     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.09.004     Document Type: Article

References (16)

1. Abouelhoda M.I., Ohlebusch E., and Kurtz S. Optimal exact string matching based on suffix arrays. In: Laender A.H.F., and Oliveira A.L. (Eds). SPIRE. Lecture Notes in Computer Science vol. 2476 (2002), Springer 31-43
2. Amir A., Chencinski E., Iliopoulos C.S., Kopelowitz T., and Zhang H. Property matching and weighted matching. In: Lewenstein M., and Valiente G. (Eds). CPM. Lecture Notes in Computer Science vol. 4009 (2006), Springer 188-199
3. A. Amir, E. Chencinski, C.S. Iliopoulos, T. Kopelowitz, H. Zhang, Property matching and weighted matching, Theor. Comput. Sci. (2007), in press
4. Apostolico A. The myriad virtues of subword trees. Combinatorial Algorithms on Words. NATO ISI Series (1985), Springer 85-96
5. M.A. Bender, M. Farach-Colton, The lca problem revisited, in: Latin American Theoretical INformatics (LATIN), 2000, pp. 88-94
6. M. Farach, Optimal suffix tree construction with large alphabets, in: FOCS, 1997, pp. 137-143
7. H. Gabow, J. Bentley, R. Tarjan, Scaling and related techniques for geometry problems, in: Symposium on the Theory of Computing (STOC), 1984, pp. 135-143
8. J. Jurka, Human repetitive elements, in: R.A. Meyers (Ed.), Molecular Biology and Biotechnology
9. J. Jurka, Origin and evolution of alu repetitive elements, in: R. Maraia (Ed.), The Impact of Short Interspersed Elements (SINEs) on the Host Genome
10. Kärkkäinen J., Sanders P., and Burkhardt S. Simple linear work suffix array construction. J. ACM 53 6 (2006) 918-936
11. Kim D.K., Sim J.S., Park H., and Park K. Constructing suffix arrays in linear time. J. Discrete Algorithms 3 2-4 (2005) 126-142
12. Ko P., and Aluru S. Space efficient linear time construction of suffix arrays. J. Discrete Algorithms 3 2-4 (2005) 143-156
13. Manber U., and Myers E.W. Suffix arrays: A new method for on-line string searches. SIAM J. Comput. 22 5 (1993) 935-948
14. McCreight E.M. A space-economical suffix tree construction algorithm. J. ACM 23 2 (1976) 262-272
15. Sadakane K. Succinct data structures for flexible text retreival systems. J. Discrete Algorithms 5 1 (2007) 12-22
16. Ukkonen E. On-line construction of suffix trees. Algorithmica 14 3 (1995) 249-260