Property matching and weighted matching

Theoretical Computer Science

Volumn 395, Issue 2-3, 2008, Pages 298-310

  Amir, Amihood ^a   Chencinski, Eran ^a   Iliopoulos, Costas ^b   Kopelowitz, Tsvi ^a   Zhang, Hui ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Pattern matching; Position weight matrices; Weighted indexing; Weighted swap matching

Indexed keywords

BIOCHEMISTRY; BIOPHYSICS; COMPUTATIONAL GEOMETRY; INDEXING (OF INFORMATION); MOLECULAR BIOLOGY; PATTERN MATCHING; PIGMENTS;

(PL) PROPERTIES; PROPERTY (S); STRING MATCHING; WEIGHTED MATCHING;

ERROR ANALYSIS;

EID: 45749098161     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.01.006     Document Type: Article

References (37)

1. A. Amir, Y. Aumann, R. Cole, M. Lewenstein, E. Porat, Function matching: Algorithms, applications and a lower bound, in: Proc. of the 30th International Colloquium on Automata, Languages and Programming, ICALP, 2003, pp. 929-942
2. Amir A., Aumann Y., Landau G., Lewenstein M., and Lewenstein N. Pattern matching with swaps. Journal of Algorithms 37 (2000) 247-266 Preliminary version appeared at FOCS 97
3. Amir A., Butman A., and Lewenstein M. Real scaled matching. Information Processing Letters 70 4 (1999) 185-190
4. A. Amir, A. Butman, M. Lewenstein, E. Porat, Real two dimensional scaled matching, in: Proc. 8th Workshop on Algorithms and Data Structures, WADS, 2003, pp. 353-364
5. Amir A., Butman A., Lewenstein M., Porat E., and Tsur D. Efficient one dimensional real scaled matching. Journal of Discrete Algorithms 5 2 (2007) 205-211
6. Amir A., and Calinescu G. Alphabet independent and dictionary scaled matching. Journal of Algorithms 36 (2000) 34-62
7. Amir A., Cole R., Hariharan R., Lewenstein M., and Porat E. Overlap matching. Information and Computation 181 1 (2003) 57-74
8. A. Amir, E. Eisenberg, E. Porat, Swap and mismatch edit distance, in: Proc. 12th Annual European Symposium on Algorithms, ESA, 2004, pp. 16-27
9. Amir A., Keselman D., Landau G.M., Lewenstein M., Lewenstein N., and Rodeh M. Text indexing and dictionary matching with one error. Journal of Algorithms 37 2 (2000) 309-325
10. Amir A., Landau G.M., Lewenstein M., and Lewenstein N. Efficient special cases of pattern matching with swaps. Information Processing Letters 68 3 (1998) 125-132
11. Amir A., Landau G.M., and Vishkin U. Efficient pattern matching with scaling. Journal of Algorithms 13 1 (1992) 2-32
12. Amir A., Lewenstein M., and Porat E. Approximate swapped matching. Information Processing Letters 83 1 (2002) 33-39
13. Boyer R.S., and Moore J.S. A fast string searching algorithm. Communications of the ACM 20 (1977) 762-772
14. Christodoulakis M., Iliopoulos C.S., Mouchard L., and Tsichlas K. Pattern matchnig on weighted sequences. Proceedings of the Algorithms and Computational Methods for Biochemical and Evolutionary Networks. CompBioNets (2004), KCL Publications
15. Cole R., Gottlieb L., and Lewenstein M. Dictionary matching and indexing with errors and don't cares. Proc. 36th annual ACM Symposium on the Theory of Computing (STOC) (2004), ACM Press 91-100
16. R. Cole, R. Harihan, Randomized swap matching in o (m log m log | σ |) time, Technical Report TR1999-789, New York University, Courant Institute, September 1999
17. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. second edition (2001), MIT Press
18. M. Farach, S. Muthukrishnan, Perfect hashing for strings: Formalization and algorithms, in: Proc. 7th Combinatorial Pattern Matching Conference, 1996, pp. 130-140
19. P. Ferragina, R. Grossi, Fast incremental text editing, in: Proc. 7th ACM-SIAM Symposium on Discrete Algorithms, 1995, pp. 531-540
20. Gesine R., Sophie S., and Waterman M.S. Probabilistic and statistical properties of words: An overview. Journal of computationnal Biology 7 1-2 (2000) 1-46
21. M. Gu, M. Farach, R. Beigel, An efficient algorithm for dynamic text indexing, in: Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 697-704
22. C.S. Iliopoulos, L. Mouchard, K. Perdikuri, A. Tsakalidis, Computing the repetitions in a weighted sequence, in: Proceeding of the Prague Stringology Conference, 2003, pp. 91-98
23. Iliopoulos C.S., Perdikuri K., Theodoridis E., Tsakalidis A., and Tsichlas K. Motif extraction from weighted sequences. In: Apostolico A., and Melucci M. (Eds). Proc. 11th Symposium on String Processing and Information Retrieval. SPIRE. LNCS vol. 3246 (2004), Springer 286-297
24. Jurka J. Origin and evolution of Alu repetitive elements. The Impact of Short Interspersed Elements (SINEs) on the Host Genome (1995) 25-41
25. Jurka J. Human repetitive elements. Molecular Biology and Biotechnology (1995) 438-441
26. Kärkkäinen J., and Sanders P. Simple linear work suffix array construction. Proc. 30th International Colloquium on Automata, Languages and Programming. ICALP 03. LNCS vol. 2719 (2003) 943-955
27. Knuth D.E., Morris J.H., and Pratt V.R. Fast pattern matching in strings. SIAM Journal on Computing 6 (1977) 323-350
28. Lowrance R., and Wagner R.A. An extension of the string-to-string correction problem. Journal of the ACM (1975) 177-183
29. McCreight E.M. A space-economical suffix tree construction algorithm. Journal of the ACM 23 (1976) 262-272
30. Muthukrishnan S. New results and open problems related to non-standard stringology. Proc. 6th Combinatorial Pattern Matching Conference. Lecture Notes in Computer Science vol. 937 (1995), Springer-Verlag 298-317
31. S. Muthukrishnan, Efficient algorithms for document retrieval problems, in: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, 2002, pp. 657-666
32. S.C. Sahinalp, U. Vishkin, Efficient approximate and dynamic matching of patterns using a labeling paradigm, in: Proc. 37th FOCS, 1996, pp. 320-328
33. Thompson J.D., Higgins D.G., and Gibson T.J. Clustal w: Improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Research 22 (1994) 4673-4680
34. Ukkonen E. On-line construction of suffix trees. Algorithmica 14 (1995) 249-260
35. Venter J.C., and Celera Genomics Corporation. The sequence of the human genome. Science 291 (2001) 1304-1351
36. R.A. Wagner, On the complexity of the extended string-to-string correction problem, in: Proc. 7th ACM STOC, 1975, pp. 218-223
37. P. Weiner, Linear pattern matching algorithm, in: Proc. 14 IEEE Symposium on Switching and Automata Theory, 1973, pp. 1-11