Abstract
Consider the following problem: Find the shortest pattern that does not occur in a given text. To make the problem non-trivial, the pattern is required to consist only of characters that occur in the text. This problem can be solved easily in linear time using the suffix tree of the text. In this paper, we study an extension of this problem, namely the missing patterns problem: Find the shortest pair of patterns that do not occur close to each other in a given text, i.e., the distance between their occurrences is always greater than a given threshold α. We show that the missing patterns problem can be solved in O( min (αnlogn,n 2)) time, where n is the size of the text. For the special case where both pairs are required to have the same length, we give an algorithm with time complexity O(αn log log n). The problem is motivated by optimization of multiplexed nested-PCR.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amir, A., Apostolico, A., Lewenstein, M.: Inverse Pattern Matching. J. Algorithms 24(2), 325–339 (1997)
Andersson, A., Larsson, N.J., Swanson, K.: Suffix trees on words. Algorithmica 23(3), 246–260 (1999)
Alberts, B., Johnson, A., Lewis, J., Raff, M., Roberts, K., Walter, P.: Molecular Biology of the Cell, 4th edn. Garland Science (2002)
Apostolico, A.: Pattern discovery and the algorithmics of surprise. Artificial Intelligence and Heuristic Methods for Bioinformatics, 111–127 (2003)
Ga̧sieniec, L., Indyk, P., Krysta, P.: External Inverse Pattern Matching. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol. 1264, pp. 90–101. Springer, Heidelberg (1997)
Gusfield, D.: Algorithms on strings, trees and sequences: Computer science and computational biology. Cambridge University Press, Cambridge (1997)
Karp, R., Rabin, M.: Efficient randomized pattern-matching algorithms. IBM Journal of Research and Development 31, 249–260 (1987)
Kärkkäinen, J., Ukkonen, E.: Sparse suffix trees. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol. 1090, pp. 219–230. Springer, Heidelberg (1996)
Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM Journal on Computing 6(2), 323–350 (1977)
Lanctot, J., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Information and Computation 185(1), 41–55 (2003)
McCreight, E.M.: A space economical suffix tree construction algorithm. Journal of the ACM 23, 262–272 (1976)
Nicodème, P., Steyaert, J.-M.: Selecting optimal oligonucleotide primers for multiplex PCR. In: Proc. of the 5th International Conference on Intelligent Systems for Molecular Biology (ISMB 1997), pp. 210–213 (1997)
Shinohara, A., Takeda, M., Arikawa, S., Hirao, M., Hoshino, H., Inenaga, S.: Finding Best Patterns Practically. In: Arikawa, S., Shinohara, A. (eds.) Progress in Discovery Science. LNCS (LNAI), vol. 2281, pp. 307–317. Springer, Heidelberg (2002)
Ukkonen, E.: On-line construction of suffix trees. Algorithmica 14, 249–260 (1995)
Wang, J., Shapiro, B., Shasha, D.: Pattern Discovery in Biomolecular Data. Oxford University Press, Oxford (1999)
Weiner, P.: Linear pattern matching algorithms. In: Proc. IEEE 14th Annual Symposium on Switching and Automata Theory, pp. 1–11 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Inenaga, S., Kivioja, T., Mäkinen, V. (2004). Finding Missing Patterns. In: Jonassen, I., Kim, J. (eds) Algorithms in Bioinformatics. WABI 2004. Lecture Notes in Computer Science(), vol 3240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30219-3_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-30219-3_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23018-2
Online ISBN: 978-3-540-30219-3
eBook Packages: Springer Book Archive