New algorithms for text fingerprinting

Journal of Discrete Algorithms

Volumn 6, Issue 2, 2008, Pages 243-255

  Kolpakov, Roman ^a   Raffinot, Mathieu ^b  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b INDEPENDENT UNIVERSITY OF MOSCOW   (Russian Federation)

Author keywords

Character set; Maximal location; Naming; Text algorithm; Text fingerprinting

Indexed keywords

COMPUTATIONAL METHODS; LEARNING ALGORITHMS; PROBLEM SOLVING; SET THEORY;

CHARACTER SET; MAXIMAL LOCATION; NAMING; TEXT ALGORITHMS; TEXT FINGERPRINTING;

TEXT PROCESSING;

EID: 42249112257     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2007.05.001     Document Type: Article

References (7)

1. Amir A., Apostolico A., Landau G.M., and Satta G. Efficient text fingerprinting via Parikh mapping. J. Discrete Algorithms 1 5-6 (2003) 409-421
2. Bergeron A., Chauve C., de Montgolfier F., and Raffinot M. Computing common intervals of k permutations, with applications to modular decomposition of graphs. European Symposium on Algorithms (ESA). Lecture Noter in Computer Science vol. 3669 (2005), Springer-Verlag 779-790
3. Cormen T., Leiserson C., and Rivest R. Introduction to Algorithms. second ed. (2001), MIT Press, Cambridge, MA, USA
4. Didier G. Common intervals of two sequences. WABI. Lecture Notes in Computer Science vol. 2812 (2003), Springer-Verlag, Berlin 17-24
5. Didier G., Schmidt T., Stoye J., and Tsur D. Character sets of strings. J. Discrete Algorithms 5 2 (2007) 330-340
6. Heber S., and Stoye J. Finding all common intervals of k permutations. Combinatorial Pattern Matching (CPM). Lecture Notes in Computer Science vol. 2089 (2001), Springer-Verlag, Berlin 207-218
7. Uno T., and Yagiura M. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26 2 (2000) 290-309