Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Buhler J, Tompa M (2002) Finding motifs using random projections. J Comput Biol 9(2):225–242
Evans PA, Smith AD, Wareham HT (2003) On the complexity of finding common approximate substrings. Theor Comput Sci 306(1–3):407–430
Fellows MR, Gramm J, Niedermeier R (2006) On the parameterized intractability of motif search problems. Combinatorica 26(2):141–167
Frances M, Litman A (1997) On covering problems of codes. Theor Comput Syst 30:113–119
Lanctot JK, Li M, Ma B, Wang S, Zhang L (2003) Distinguishing string search problems. Inf Comput 185:41–55
Li M, Ma B, Wang L (2002) On the closest string and substring problems. J ACM 49(2):157–171
Marx D (2005) The closest substring problem with small distances. In: Proceedings of the 46th FOCS. IEEE Press, pp 63–72
Pevzner PA, Sze SH (2000) Combinatorial approaches to finding subtle signals in DNA sequences. In: Proceedings of 8th ISMB. AAAI Press, pp 269–278
Sagot MF (1998) Spelling approximate repeated or common motifs using a suffix tree. In: Proceedings of the 3rd LATIN. LNCS, vol 1380. Springer, pp 111–127
Wang J, Huang M, Cheng J (2007) A lower bound on approximation algorithms for the closest substring problem. In: Proceedings of the COCOA 2007. LNCS, vol 4616, pp 291–300
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Gramm, J. (2016). Closest Substring. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_74
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_74
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering