Closest string with outliers
Open Access
- 15 February 2011
- journal article
- conference paper
- Published by Springer Nature in BMC Bioinformatics
- Vol. 12 (S1) , S55
Abstract
Given n strings s1, …, sn each of length ℓ and a nonnegative integer d, the CLOSEST STRING problem asks to find a center string s such that none of the input strings has Hamming distance greater than d from s. Finding a common pattern in many – but not necessarily all – input strings is an important task that plays a role in many applications in bioinformatics.Keywords
This publication has 16 references indexed in Scilit:
- Closest Substring Problems with Small DistancesSIAM Journal on Computing, 2008
- On The Parameterized Intractability Of Motif Search Problems*Combinatorica, 2006
- Assessing computational tools for the discovery of transcription factor binding sitesNature Biotechnology, 2005
- Fixed-Parameter Algorithms for CLOSEST STRING and Related ProblemsAlgorithmica, 2003
- Distinguishing string selection problemsInformation and Computation, 2003
- Genetic Design of Drugs Without Side-EffectsSIAM Journal on Computing, 2003
- Finding Similar Regions in Many SequencesJournal of Computer and System Sciences, 2002
- Primer Master: a new program for the design and analysis of PCR primersBioinformatics, 1996
- Design of primers for PCR ampiification of highly variable genomesBioinformatics, 1993
- An improved microcomputer program for finding gene- or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probesBioinformatics, 1991