Pattern matching in degenerate DNA/RNA sequences

Proceedings of the 1st Workshop on Algorithms and Computation 2007, WALCOM 2007

Volumn , Issue , 2014, Pages 109-120

  Rahman, M Sohel ^a   Iliopoulos, Costas S ^a   Mouchard, L ^b  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b UNIVERSITÉ DE ROUEN   (France)

Author keywords

Algorithm; Degenerate; DNA RNA sequence; Pattern matching

Indexed keywords

ALGORITHMS; DNA; DNA SEQUENCES; PATTERN MATCHING;

DEGENERATE; DISTRIBUTED PATTERNS; EFFICIENT IMPLEMENTATION; LINEAR TIME; PATTERN MATCHING PROBLEMS; PATTERN SIZE; RNA SEQUENCES;

BIOINFORMATICS;

EID: 38149028889     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. K. Abrahamson. Generalized string matching. SIAM Journal of Computing, 16(6):1039-1051, 1987.
2. A. Aho and M. Corasick. Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18:333-340, 1975.
3. M. Akerman and Y. Mandel-Gutfreund. Alternative splicing regulation at tandem 3' splice sites. Nucl. Acid. Res., 34(1):23-31, 2006.
4. R. Baeza-Yates and G.H. Gonnet. A new approach to text searching. Communications of the ACM, 35:74-82, 1992.
5. R. S. Boyer and J. S. Moore. A fast string searching algorithm. Communications of the ACM, 20(10):762-772, 1977.
6. L. Cartegni and A.R. Krainer. Disruption of an SF2/ASF-dependent exonic splicing enhancer in SMN2 causes spinal muscular atrophy in the absence of SMN1. Nature Genetics, 30:377-384, 2002.
7. R. Cole and R. Hariharan. Tree pattern matching and subset matching in randomized o(nlog3m) time. In Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 245-254, 1999.
8. R. Cole, R. Hariharan, and P. Indyk. Tree pattern matching and subset matching in deterministic o(nlog3n) time. In Twenty Ninth Annual Symposium on the Theory of Computing, pages 66-75, 1997.
9. T. Crawford, C.S. Iliopoulos, and R. Raman. String matching techniques for musical similarity and melody recognition. Computing in Musicology, 11:227-236, 1998.
10. B. Domolki. An algorithm for syntactical analysis. Computational Linguistics, 3:29-46, 1964.
11. M.J. Fischer and M.S. Paterson. String matching and other products. in Complexity of Computation, R.M. Karp (editor), SIAM AMS Proceedings, 7:113-125, 1974.
12. J. Holub, C.S. Iliopoulos, B. Melichar, and L. Mouchard. Distributed pattern matching using finite automata. Journal of Automata, Languages and Combinatorics , 6(2):191-204, 2001.
13. J. Holub, W. F. Smyth, and S. Wang. Fast pattern-matching on indeterminate strings. In 16th Australasian Workshop on Combinatorial Algorithms, pages 415-428, 2005.
14. A. Hume and D. Sunday. Fast string searching. Software Practice & Experience, 21(11):1221-1248, 1991.
15. P. Indyk. Faster algorithms for string matching problems: matching the convolution bound. In 39th Symposium on Foundations of Computer Science, 1998.
16. A. Kalai. Efficient pattern-matching with don't cares. In Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, pages 655-656, 2002.
17. D. E. Knuth, J. H. Morris Jr., and V. R. Pratt. Fast pattern matching in strings. SIAM Journal of Computing, 6(2):323-350, 1977.
18. J.B.J. Kwoka, G. M. Hallidaybc, W. S. Brooksbd, G. Doliose, H. Laudonf, O. Murayamagand M. Halluppa, R. F. Badenhopac, J. Vickersh, R. Wange, J. Naslundf, A. Takashimag, S.E. Gandyi, and P.R. Schofieldacj. Presenilin-1 mutation l271v results in altered exon 8 splicing and alzheimer's disease with non-cored plaques and no neuritic dystrophy. Journal of Biological Chemistry, 278(9):6748-6754, 2003.
19. T. Lecroq. Experimental results on string matching algorithms. Software Practice & Experience, 25(7):727-765, 1995.
20. I. Lee, A. Apostolico, C. S. Iliopoulos, and K. Park. Finding approximate occurrence of a pattern that contains gaps. In 14th Australasian Workshop on Combinatorial Algorithms, pages 89-100, 2003.
21. S. Muthukrishan and K. Palem. Non-standard stringology: Algorithms and complexity. In 26th Symposium on the Theory of Computing, Canada, 1994.
22. S. Muthukrishan and H. Ramesh. Non-standard stringology: Algorithms and complexity. Information and Computation, 122(1):140-148, 1995.
23. Nomenclature Committee of the International Union of Biochemistry (NC-IUB). Nomenclature for incompletely specified bases in nucleic acid sequences. recommendations 1984. Eur J Biochem, (150):1-5, 1985.
24. R.Y. Pinter. Private communication.
25. R.Y. Pinter. Efficient string matching with dont care patterns. In A. Apostolico and Z. Galil, editors, Combinatorial algorithms on words, NATO Advanced Science Institute Series F: Computer and System Sciences, volume 12, pages 11-29, 1985.
26. G. D. Stormo, T. D. Schneider, L. Gold, and A. Ehrenfeucht. Use of the 'perceptron' algorithm to distinguish translational initiation sites in E. coli. Nucl. Acids Res., (10):2997-3011, 1982.
27. D. M. Sunday. A very fast substring search algorithm. Communications of the ACM, 33(8):132-142, 1990.
28. S. Wu and U. Manber. Agrep-a fast approximate pattern-matching tool. pages 153-162, 1992.
29. S. Wu and U. Manber. Fast text searching allowing errors. Communications of the ACM, 35(10):83-91, 1992.