Finding missing patterns

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3240, Issue , 2004, Pages 463-474

  Inenaga, Shunsuke ^a   Kivioja, Teemu ^a   Mäkinen, Veli ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; COMPUTATIONAL COMPLEXITY;

FOLLOWING PROBLEM; LINEAR TIME; NESTED PCR; NON-TRIVIAL; SUFFIX-TREES; TIME COMPLEXITY;

OPTIMIZATION;

EID: 33646730028     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30219-3_39     Document Type: Article

References (16)

1. A. Amir, A. Apostolico, and M. Lewenstein. Inverse Pattern Matching. J. Algorithms, 24(2):325-339, 1997.
2. A. Andersson, N. J. Larsson, and K. Swanson. Suffix trees on words. Algorithmica, 23(3):246-260, 1999.
3. B. Alberts, A. Johnson, J. Lewis, M. Raff, K. Roberts, and P. Walter. Molecular Biology of the Cell, fourth edition. Garland Science, 2002.
4. A. Apostolico. Pattern discovery and the algorithmics of surprise. Artificial Intelligence and Heuristic Methods for Bioinformatics, pp. 111-127, 2003.
5. L. Ga̧sieniec, P. Indyk, P. Krysta. External Inverse Pattern Matching. In Proc. Combinatorial Pattern Matching 97 (CPM'97), Springer-Verlag LNCS 1264, pp. 90-101, 1997.
6. D. Gusfield. Algorithms on strings, trees and sequences: Computer science and computational biology. Cambridge University Press, 1997.
7. R. Karp and M. Rabin. Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development, 31:249-260, 1987.
8. J. Kärkkäinen and E. Ukkonen. Sparse suffix trees. In Proc. Second Annual International Computing and Combinatorics Conference (COCOON '96), Springer-Verlag LNCS 1090, pp. 219-230, 1996.
9. D. Knuth, J. Morris, and V. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6(2):323-350, 1977.
10. J. Lanctot, M. Li, B. Ma, S. Wang, and L. Zhang. Distinguishing string selection problems. Information and Computation, 185(1):41-55, 2003.
11. E. M. McCreight. A space economical suffix tree construction algorithm. Journal of the ACM, 23, pp. 262-272, 1976.
12. P. Nicodème and J.-M. Steyaert. Selecting optimal oligonucleotide primers for multiplex PCR. In Proc. of the 5th International Conference on Intelligent Systems for Molecular Biology (ISMB'97), pp. 210-213, 1997.
13. A. Shinohara, M. Takeda, S. Arikawa, M. Hirao, H. Hoshino, and S. Inenaga. Finding Best Patterns Practically. In Progress in Discovery Science (Final Report of the Japanese Discovery Science), Springer-Verlag LNAI 2281, pp. 307-317, 2002.
14. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14:249-260, 1995.
15. J. Wang, B. Shapiro, and D. Shasha. Pattern Discovery in Biomolecular Data., Oxford University Press, 1999.
16. P. Weiner. Linear pattern matching algorithms. In Proc. IEEE 14th Annual Symposium on Switching and Automata Theory, pp. 1-11, 1973.