Abstract
Given a set of sequences, S, and degeneracy parameter, d, the Consensus Sequence problem asks whether there exists a sequence that has Hamming distance at most d from each sequence in S. A valid motif set is a set of sequences for which such a consensus sequence exists, while a decoy set is a set of sequences that does not have a consensus sequence but whose pairwise Hamming distances are all at most 2d. At present, no efficient solution is known to the Consensus Sequence problem when the number of sequences is greater than three. For instances of Consensus Sequence with binary sequences and cardinality four, we present a combinatorial characterization of decoy sets and a linear-time exact algorithm, resolving an open problem posed by Gramm et al. [7].
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
Brejová, B., Brown, D., Harrower, I., López–Ortiz, A., Vinař, T.: Sharper upper and lower bounds for an approximation scheme for Consensus–Pattern. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005, vol. 3537, pp. 1–10. Springer, Heidelberg (2005)
Brejová, B., Brown, D., Harrower, I., Vinař, T.: New bounds for motif-finding in strong instances. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 94–105. Springer, Heidelberg (2006)
Cohen, G., Honkala, I., Litsyn, S., Sole, P.: Long packing and covering codes. IEEE Trans. Inf. Theory 43(5), 1617–1619 (1997)
Fellows, M., Gramm, J., Niedermeier, R.: On the parameterized intractability of motif search problems. Combinatorica 26(2), 141–167 (2006)
Frances, M., Litman, A.: On covering problems of codes. Th. Comp. Sys. 30, 113–119 (1997)
Graham, R.L., Sloane, N.J.A.: On the covering radius of codes. Trans. Inf. Theory 31, 385–401 (1985)
Gramm, J., Niedermeier, R., Rossmanith, P.: Exact solutions for Closest String and related problems. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001, vol. 2223, pp. 441–453. Springer, Heidelberg (2001)
Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica 37(1), 25–42 (2003)
Gramm, J., Guo, J., Niedermeier, R.: Parameterized intractability of distinguishing substring selection. Th. Comp. Sys. 39(4), 545–560 (2006)
Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. In: Proc. SODA 1999, pp. 633–642 (1999)
Lenstra, W.H.: Integer programming with a fixed number of variables. Math. of OR 8, 538–548 (1983)
Li, M., Ma, B., Wang, L.: Finding similar regions in many strings. J. Comp. and Sys. Sci. 65(1), 73–96 (2002)
Pevzner, P., Sze, S.: Combinatorial approaches to finding subtle signals in DNA sequences. In: Proc. ISMB 2000, pp. 344–354 (2000)
Sze, S., Lu, S., Chen, J.: Integrating sample-driven and patter-driven approaches in motif finding. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol. 3240, pp. 438–449. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boucher, C., Brown, D.G., Durocher, S. (2008). On the Structure of Small Motif Recognition Instances. In: Amir, A., Turpin, A., Moffat, A. (eds) String Processing and Information Retrieval. SPIRE 2008. Lecture Notes in Computer Science, vol 5280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89097-3_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-89097-3_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89096-6
Online ISBN: 978-3-540-89097-3
eBook Packages: Computer ScienceComputer Science (R0)