Character sets of strings

Journal of Discrete Algorithms

Volumn 5, Issue 2 SPEC. ISS., 2007, Pages 330-340

  Didier, Gilles ^a   Schmidt, Thomas ^b   Stoye, Jens ^b   Tsur, Dekel ^c  

^a Centro de Modelamiento Matematico CNRS UMR 2071 Santiago de Chile   (Chile)

^b BIELEFELD UNIVERSITY   (Germany)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Character sets; Combinatorial algorithms on words; Comparative genomics; Fingerprints; Natural language processing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FORMAL LANGUAGES; PROBLEM SOLVING; SET THEORY;

COMBINATORIAL ALGORITHMS; COMPARATIVE GENOMICS; FINGERPRINTS; NATURAL LANGUAGE PROCESSING; SPACE COMPLEXITY;

CHARACTER SETS;

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

References (9)

1. Dandekar T., Snel B., Huynen M., and Bork P. Conservation of gene order: a fingerprint of proteins that physically interact. Trends Biochem. Sci. 23 (1998) 324-328
2. Rogozin I.B., Makarova K.S., Murvai J., Czabarka E., Wolf Y.I., Tatusov R.L., Szekely L.A., and Koonin E.V. Connected gene neighborhoods in prokaryotic genomes. Nucleic Acids Res. 30 (2002) 2212-2223
3. Uno T., and Yagiura M. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26 (2000) 290-309
4. Heber S., and Stoye J. Finding all common intervals of k permutations. Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching. CPM 2001. Lecture Notes in Computer Science vol. 2089 (2001), Springer-Verlag, Berlin 207-218
5. Schmidt T., and Stoye J. Quadratic time algorithms for finding common intervals in two and more sequences. Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching. CPM 2004. Lecture Notes in Computer Science vol. 3109 (2004), Springer-Verlag, Berlin 347-358
6. Karlsson F., Voutilainen A., Heikkilä J., and Antilla A. Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text (1995), Mouton de Gruyter
7. Amir A., Apostolico A., Landau G.M., and Satta G. Efficient text fingerprinting via Parikh mapping. J. Discrete Algorithms 26 (2003) 1-13
8. Didier G. Common intervals of two sequences. Proceedings of the Third International Workshop on Algorithms in Bioinformatics. WABI 2003. Lecture Notes in Bioinformatics vol. 2812 (2003), Springer-Verlag, Berlin 17-24
9. Bender M.A., and Farach-Colton M. The LCA problem revisited. Proceedings of the 4th Latin American Symposium on Theoretical Informatics. LATIN 2000. Lecture Notes in Computer Science vol. 1776 (2000), Springer-Verlag, Berlin 88-94