Randomized Fixed-Parameter Algorithms for the Closest String Problem
Given a set S = { s 1 , s 2 , … , s n } of strings of equal length L and an integer d , the closest string problem (CSP) requires the computation of a string s of length L such that d ( s , s i ) ≤ d for each s i ∈ S , where d ( s , s i ) is the Hamming distance between s and s i . The problem is NP...
Uložené v:
| Vydané v: | Algorithmica Ročník 74; číslo 1; s. 466 - 484 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York
Springer US
01.01.2016
|
| Predmet: | |
| ISSN: | 0178-4617, 1432-0541 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Given a set
S
=
{
s
1
,
s
2
,
…
,
s
n
}
of strings of equal length
L
and an integer
d
, the
closest string problem
(CSP) requires the computation of a string
s
of length
L
such that
d
(
s
,
s
i
)
≤
d
for each
s
i
∈
S
, where
d
(
s
,
s
i
)
is the Hamming distance between
s
and
s
i
. The problem is NP-hard and has been extensively studied in the context of approximation algorithms and fixed-parameter algorithms. Fixed-parameter algorithms provide the most practical solutions to its real-life applications in bioinformatics. In this paper we develop the first randomized fixed-parameter algorithms for CSP. Not only are the randomized algorithms much simpler than their deterministic counterparts, their time complexities are also significantly better than the previously best known (deterministic) algorithms. |
|---|---|
| AbstractList | Given a set
S
=
{
s
1
,
s
2
,
…
,
s
n
}
of strings of equal length
L
and an integer
d
, the
closest string problem
(CSP) requires the computation of a string
s
of length
L
such that
d
(
s
,
s
i
)
≤
d
for each
s
i
∈
S
, where
d
(
s
,
s
i
)
is the Hamming distance between
s
and
s
i
. The problem is NP-hard and has been extensively studied in the context of approximation algorithms and fixed-parameter algorithms. Fixed-parameter algorithms provide the most practical solutions to its real-life applications in bioinformatics. In this paper we develop the first randomized fixed-parameter algorithms for CSP. Not only are the randomized algorithms much simpler than their deterministic counterparts, their time complexities are also significantly better than the previously best known (deterministic) algorithms. |
| Author | Ma, Bin Chen, Zhi-Zhong Wang, Lusheng |
| Author_xml | – sequence: 1 givenname: Zhi-Zhong surname: Chen fullname: Chen, Zhi-Zhong email: zzchen@mail.dendai.ac.jp organization: Division of Information System Design, Tokyo Denki University – sequence: 2 givenname: Bin surname: Ma fullname: Ma, Bin organization: School of Computer Science, University of Waterloo – sequence: 3 givenname: Lusheng surname: Wang fullname: Wang, Lusheng organization: Department of Computer Science, City University of Hong Kong |
| BookMark | eNp9kMtOwzAURC1UJNrCB7DLDxiuE8eOl1WhgFSJisfacuLb1lUSV7aRKF9PqrJi0dWszmjmTMio9z0ScsvgjgHI-wjAy4IC41SpMqeHCzJmvMgplJyNyBiYrCgXTF6RSYw7AJZLJcbk4c301nfuB222cN9o6coE02HCkM3ajQ8ubbuYrX3I0hazeesjxpS9p-D6TbYKvm6xuyaXa9NGvPnLKflcPH7Mn-ny9ellPlvShuc8USYaWdSNUjBMrME2yEEVrCyFkjnWUhmQORdoa0QrK2FNKURV2LpAUWFZFVMiT71N8DEGXOvGJZOc71MwrtUM9FGGPsnQgwx9lKEPA8n-kfvgOhMOZ5n8xMT98SwGvfNfoR8OnoF-AX81dGM |
| CitedBy_id | crossref_primary_10_1016_j_tcs_2018_05_017 crossref_primary_10_1007_s00453_020_00787_3 |
| Cites_doi | 10.1007/978-3-540-45077-1_19 10.1137/060673898 10.1186/1471-2105-7-S4-S9 10.1137/080739069 10.1016/j.jcss.2011.01.003 10.1137/S0097539701397825 10.1007/s00453-008-9206-y 10.1007/11758525_110 10.1007/978-3-642-15294-8_27 10.1145/1993636.1993699 10.1007/3-540-63307-3_53 10.1142/S0219720005001508 10.1007/3-540-44888-8_23 10.1007/978-3-642-02270-8_27 10.1109/TCBB.2011.21 10.1089/cmb.2009.0098 10.1007/s00493-006-0011-4 10.1007/978-3-540-27801-6_10 10.1007/3-540-63220-4_63 10.1007/978-3-642-33293-7_2 10.1016/S0890-5401(03)00057-9 10.1287/ijoc.1040.0090 10.1007/978-3-642-38768-5_10 10.1145/506147.506150 10.1007/s00453-003-1028-3 10.1007/978-3-642-00727-9_15 10.1109/CSB.2003.1227407 10.1007/978-3-540-45077-1_20 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media New York 2014 |
| Copyright_xml | – notice: Springer Science+Business Media New York 2014 |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s00453-014-9952-y |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1432-0541 |
| EndPage | 484 |
| ExternalDocumentID | 10_1007_s00453_014_9952_y |
| GroupedDBID | -4Z -59 -5G -BR -EM -Y2 -~C -~X .86 .DC .VR 06D 0R~ 0VY 199 1N0 1SB 203 23M 28- 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDPE ABDZT ABECU ABFSI ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTAH ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP E.L EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P9O PF- PT4 PT5 QOK QOS R4E R89 R9I RHV RIG RNI RNS ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UQL UTJUX UZXMN VC2 VFIZW VH1 VXZ W23 W48 WK8 YLTOR Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZMTXR ZY4 ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION |
| ID | FETCH-LOGICAL-c424t-16c73bc990995b0dce40931556972eb79a07246edbeed786da56683db3e68e583 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000367622200016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0178-4617 |
| IngestDate | Sat Nov 29 02:20:27 EST 2025 Tue Nov 18 22:38:17 EST 2025 Fri Feb 21 02:40:21 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | Randomized algorithms Fixed-parameter algorithms The closest string problem Computational biology |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c424t-16c73bc990995b0dce40931556972eb79a07246edbeed786da56683db3e68e583 |
| PageCount | 19 |
| ParticipantIDs | crossref_citationtrail_10_1007_s00453_014_9952_y crossref_primary_10_1007_s00453_014_9952_y springer_journals_10_1007_s00453_014_9952_y |
| PublicationCentury | 2000 |
| PublicationDate | 2016-01-01 |
| PublicationDateYYYYMMDD | 2016-01-01 |
| PublicationDate_xml | – month: 01 year: 2016 text: 2016-01-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Algorithmica |
| PublicationTitleAbbrev | Algorithmica |
| PublicationYear | 2016 |
| Publisher | Springer US |
| Publisher_xml | – name: Springer US |
| References | Davila, J., Balla, S., Rajasekaran, S.: Space and time efficient algorithms for planted motif search. In: Proceedings of the International Conference on Computational Science, pp. 822–829 (2006) GrammJNiedermeierRRossmanithPFixed-parameter algorithms for closest string and related problemsAlgorithmica20033725421058.68119198461510.1007/s00453-003-1028-3 Jiao, Y., Xu, J., Li, M.: On the k-closest substring and k-consensus pattern problems. In: Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, pp. 130–144 (2004) Chen, J., Lu, S., Sze, S.H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 298–307 (2007) Zhao, R., Zhang, N.: A more efficient closest string algorithm. In: Proceedings of the 2nd International Conference on Bioinformatics and Computational Biology (2010) Mauch, H., Melzer, M.J., Hu, J.S.: Genetic algorithm approach for the closest string problem. In: Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference (CSB), pp. 560–561 (2003) ChenZ-ZMaBWangLA three-string approach to the closest string problemJ. Comput. Syst. Sci.2012781641781238.68190289635410.1016/j.jcss.2011.01.003 Marx, D.: Randomized techniques for parameterized algorithms. In: Proceedings of the 7th International Symposium on Parameterized and Exact Computation (IPEC), p. 2 (2012) ChenZ-ZWangLFast exact algorithms for the closest string and substring problems with application to the planted (ℓ,d)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(\ell , d)$$\end{document}-motif modelIEEE/ACM Trans. Comput. Biol. Bioinform.2011851400141010.1109/TCBB.2011.21 Wang, L., Zhu, B.: Efficient algorithms for the closest string and distinguishing string selection problems. In: Proceedings of the 3rd International Frontiers of Algorithmics Workshop, pp. 261–270 (2009) ChenJLuSImproved parameterized set splitting algorithms: a probabilistic approachAlgorithmica200854447248910.1007/s00453-008-9206-y MaBSunXMore efficient algorithms for closest string and substring problemsSIAM J. Comput.201039414321443255180810.1137/080739069 LiMMaBWangLOn the closest string and substring problemsJ. ACM2002492157171214782110.1145/506147.506150 Boucher, C., Brown, D.: Detecting motifs in a large data set: applying probabilistic insights to motif finding. In: Proceedings of the Conference on Bioinformatics and Computational Biology (BICoB), pp. 139–150 (2009) LucasKBuschMMösingerSThompsonJAAn improved microcomputer program for finding gene- or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probesCABIOS19917525529 Nicolas, F., Rivals, E.: Complexities of the centre and median string problems. In: Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, pp. 315–327 (2003) WangYChenWLiXChengBDegenerated primer design to amplify the heavy chain variable region from immunoglobulin cDNABMC Bioinform.20067Suppl. 4S910.1186/1471-2105-7-S4-S9 Hufsky, F., Kuchenbecker, L., Jahn, K., Stoye, J., Böcker, S.: Swiftly computing center strings. In: Proceedings of the 10th International Workshop on Algorithms in Bioinformatics, pp. 325–336 (2010) ProutskiVHolmeECPrimer master: a new program for the design and analysis of PCR primersCABIOS199612253255 WangLDongLRandomized algorithms for motif detectionJ. Bioinform. Comput. Biol.20053510391052217037410.1142/S0219720005001508 DengXLiGLiZMaBWangLGenetic design of drugs without side-effectsSIAM J. Comput.2003324107310901029.68159200189810.1137/S0097539701397825 FellowsMRGrammJNiedermeierROn the parameterized intractability of motif search problemsCombinatorica20062621411671109.68049222363210.1007/s00493-006-0011-4 Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC), pp. 469–478 (2011) Evans, P.A., Smith, A.D.: Complexity of approximating closest substring problems. In Proceedings of the 14th International Symposium on Foundations of Complexity Theory, pp. 210–221 (2003) Böcker, S., Jahn, K., Mixtacki, J., Stoye, J.: Computation of median gene clusters. J. Comput. Biol. 16(8), 1085–1099 (2009) Ben-Dor, A., Lancia, G., Perone, J., Ravi, R.: Banishing bias from consensus sequences. In: Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching, pp. 247–261 (1997) Feng, Q., Wang, J., Li, S., Chen, J.: Random methods for parameterized problems. In: Proceedings of the 19th International Computing and Combinatorics Conference (COCOON), pp. 89–100 (2013) Gramm, J., Guo, J., Niedermeier, R.: On exact and approximation algorithms for distinguishing substring selection. In: Proceedings of the 14th International Symposium on Foundations of Complexity Theory, pp. 159–209 (2003) Gramm, J., Hüffner, F., Niedermeier, R.: Closest strings, primer design, and motif search. In: Florea, L. et al. (eds.) Currents in Computational Molecular Biology. Poster Abstracts of RECOMB 2002, pp. 74–75 MenesesCNLuZOliveiraCASPardalosPMOptimal solutions for the closest-string problem via integer programmingINFORMS J. Comput.2004164194291239.90077209832310.1287/ijoc.1040.0090 DopazoJRodríguezASáizJCSobrinoFDesign of primers for PCR amplification of highly variable genomesCABIOS19939123125 LanctotKLiMMaBWangSZhangLDistinguishing string search problemsInf. Comput.200318541551069.68116199474810.1016/S0890-5401(03)00057-9 MarxDClosest substring problems with small distancesSIAM J. Comput.2008384138214101178.68695244845310.1137/060673898 Stojanovic, N., Berman, P., Gumucio, D., Hardison, R., Miller, W.: A linear-time algorithm for the 1-mismatch problem. In: Proceedings of the 5th International Workshop on Algorithms and Data Structures, pp. 126–135 (1997) FrancesMLitmanAOn covering problems of codesTheor. Comput. Sci.1997301131190868.940561424931 9952_CR27 9952_CR25 9952_CR26 Y Wang (9952_CR34) 2006; 7 J Gramm (9952_CR17) 2003; 37 Z-Z Chen (9952_CR7) 2011; 8 B Ma (9952_CR23) 2010; 39 V Proutski (9952_CR30) 1996; 12 Z-Z Chen (9952_CR6) 2012; 78 9952_CR29 CN Meneses (9952_CR28) 2004; 16 M Li (9952_CR21) 2002; 49 L Wang (9952_CR32) 2005; 3 J Dopazo (9952_CR10) 1993; 9 M Frances (9952_CR14) 1997; 30 K Lanctot (9952_CR20) 2003; 185 9952_CR16 9952_CR3 MR Fellows (9952_CR12) 2006; 26 9952_CR2 K Lucas (9952_CR22) 1991; 7 9952_CR1 9952_CR15 9952_CR8 9952_CR13 D Marx (9952_CR24) 2008; 38 9952_CR35 9952_CR5 9952_CR11 9952_CR33 X Deng (9952_CR9) 2003; 32 9952_CR18 J Chen (9952_CR4) 2008; 54 9952_CR19 9952_CR31 |
| References_xml | – reference: DengXLiGLiZMaBWangLGenetic design of drugs without side-effectsSIAM J. Comput.2003324107310901029.68159200189810.1137/S0097539701397825 – reference: WangLDongLRandomized algorithms for motif detectionJ. Bioinform. Comput. Biol.20053510391052217037410.1142/S0219720005001508 – reference: Feng, Q., Wang, J., Li, S., Chen, J.: Random methods for parameterized problems. In: Proceedings of the 19th International Computing and Combinatorics Conference (COCOON), pp. 89–100 (2013) – reference: Boucher, C., Brown, D.: Detecting motifs in a large data set: applying probabilistic insights to motif finding. In: Proceedings of the Conference on Bioinformatics and Computational Biology (BICoB), pp. 139–150 (2009) – reference: Evans, P.A., Smith, A.D.: Complexity of approximating closest substring problems. In Proceedings of the 14th International Symposium on Foundations of Complexity Theory, pp. 210–221 (2003) – reference: Böcker, S., Jahn, K., Mixtacki, J., Stoye, J.: Computation of median gene clusters. J. Comput. Biol. 16(8), 1085–1099 (2009) – reference: LiMMaBWangLOn the closest string and substring problemsJ. ACM2002492157171214782110.1145/506147.506150 – reference: Ben-Dor, A., Lancia, G., Perone, J., Ravi, R.: Banishing bias from consensus sequences. In: Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching, pp. 247–261 (1997) – reference: Chen, J., Lu, S., Sze, S.H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 298–307 (2007) – reference: Gramm, J., Hüffner, F., Niedermeier, R.: Closest strings, primer design, and motif search. In: Florea, L. et al. (eds.) Currents in Computational Molecular Biology. Poster Abstracts of RECOMB 2002, pp. 74–75 – reference: Stojanovic, N., Berman, P., Gumucio, D., Hardison, R., Miller, W.: A linear-time algorithm for the 1-mismatch problem. In: Proceedings of the 5th International Workshop on Algorithms and Data Structures, pp. 126–135 (1997) – reference: Zhao, R., Zhang, N.: A more efficient closest string algorithm. In: Proceedings of the 2nd International Conference on Bioinformatics and Computational Biology (2010) – reference: DopazoJRodríguezASáizJCSobrinoFDesign of primers for PCR amplification of highly variable genomesCABIOS19939123125 – reference: Wang, L., Zhu, B.: Efficient algorithms for the closest string and distinguishing string selection problems. In: Proceedings of the 3rd International Frontiers of Algorithmics Workshop, pp. 261–270 (2009) – reference: LucasKBuschMMösingerSThompsonJAAn improved microcomputer program for finding gene- or gene family-specific oligonucleotides suitable as primers for polymerase chain reactions or as probesCABIOS19917525529 – reference: Mauch, H., Melzer, M.J., Hu, J.S.: Genetic algorithm approach for the closest string problem. In: Proceedings of the 2nd IEEE Computer Society Bioinformatics Conference (CSB), pp. 560–561 (2003) – reference: Davila, J., Balla, S., Rajasekaran, S.: Space and time efficient algorithms for planted motif search. In: Proceedings of the International Conference on Computational Science, pp. 822–829 (2006) – reference: ChenZ-ZWangLFast exact algorithms for the closest string and substring problems with application to the planted (ℓ,d)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(\ell , d)$$\end{document}-motif modelIEEE/ACM Trans. Comput. Biol. Bioinform.2011851400141010.1109/TCBB.2011.21 – reference: Marx, D., Razgon, I.: Fixed-parameter tractability of multicut parameterized by the size of the cutset. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (STOC), pp. 469–478 (2011) – reference: MenesesCNLuZOliveiraCASPardalosPMOptimal solutions for the closest-string problem via integer programmingINFORMS J. Comput.2004164194291239.90077209832310.1287/ijoc.1040.0090 – reference: MarxDClosest substring problems with small distancesSIAM J. Comput.2008384138214101178.68695244845310.1137/060673898 – reference: FellowsMRGrammJNiedermeierROn the parameterized intractability of motif search problemsCombinatorica20062621411671109.68049222363210.1007/s00493-006-0011-4 – reference: Gramm, J., Guo, J., Niedermeier, R.: On exact and approximation algorithms for distinguishing substring selection. In: Proceedings of the 14th International Symposium on Foundations of Complexity Theory, pp. 159–209 (2003) – reference: Jiao, Y., Xu, J., Li, M.: On the k-closest substring and k-consensus pattern problems. In: Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, pp. 130–144 (2004) – reference: MaBSunXMore efficient algorithms for closest string and substring problemsSIAM J. Comput.201039414321443255180810.1137/080739069 – reference: GrammJNiedermeierRRossmanithPFixed-parameter algorithms for closest string and related problemsAlgorithmica20033725421058.68119198461510.1007/s00453-003-1028-3 – reference: WangYChenWLiXChengBDegenerated primer design to amplify the heavy chain variable region from immunoglobulin cDNABMC Bioinform.20067Suppl. 4S910.1186/1471-2105-7-S4-S9 – reference: Nicolas, F., Rivals, E.: Complexities of the centre and median string problems. In: Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, pp. 315–327 (2003) – reference: ChenZ-ZMaBWangLA three-string approach to the closest string problemJ. Comput. Syst. Sci.2012781641781238.68190289635410.1016/j.jcss.2011.01.003 – reference: LanctotKLiMMaBWangSZhangLDistinguishing string search problemsInf. Comput.200318541551069.68116199474810.1016/S0890-5401(03)00057-9 – reference: Marx, D.: Randomized techniques for parameterized algorithms. In: Proceedings of the 7th International Symposium on Parameterized and Exact Computation (IPEC), p. 2 (2012) – reference: ChenJLuSImproved parameterized set splitting algorithms: a probabilistic approachAlgorithmica200854447248910.1007/s00453-008-9206-y – reference: Hufsky, F., Kuchenbecker, L., Jahn, K., Stoye, J., Böcker, S.: Swiftly computing center strings. In: Proceedings of the 10th International Workshop on Algorithms in Bioinformatics, pp. 325–336 (2010) – reference: FrancesMLitmanAOn covering problems of codesTheor. Comput. Sci.1997301131190868.940561424931 – reference: ProutskiVHolmeECPrimer master: a new program for the design and analysis of PCR primersCABIOS199612253255 – ident: 9952_CR16 – volume: 9 start-page: 123 year: 1993 ident: 9952_CR10 publication-title: CABIOS – ident: 9952_CR15 doi: 10.1007/978-3-540-45077-1_19 – volume: 38 start-page: 1382 issue: 4 year: 2008 ident: 9952_CR24 publication-title: SIAM J. Comput. doi: 10.1137/060673898 – volume: 12 start-page: 253 year: 1996 ident: 9952_CR30 publication-title: CABIOS – volume: 7 start-page: S9 issue: Suppl. 4 year: 2006 ident: 9952_CR34 publication-title: BMC Bioinform. doi: 10.1186/1471-2105-7-S4-S9 – volume: 39 start-page: 1432 issue: 4 year: 2010 ident: 9952_CR23 publication-title: SIAM J. Comput. doi: 10.1137/080739069 – volume: 78 start-page: 164 year: 2012 ident: 9952_CR6 publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2011.01.003 – volume: 32 start-page: 1073 issue: 4 year: 2003 ident: 9952_CR9 publication-title: SIAM J. Comput. doi: 10.1137/S0097539701397825 – volume: 54 start-page: 472 issue: 4 year: 2008 ident: 9952_CR4 publication-title: Algorithmica doi: 10.1007/s00453-008-9206-y – ident: 9952_CR8 doi: 10.1007/11758525_110 – ident: 9952_CR18 doi: 10.1007/978-3-642-15294-8_27 – ident: 9952_CR5 – volume: 7 start-page: 525 year: 1991 ident: 9952_CR22 publication-title: CABIOS – ident: 9952_CR26 doi: 10.1145/1993636.1993699 – ident: 9952_CR31 doi: 10.1007/3-540-63307-3_53 – volume: 3 start-page: 1039 issue: 5 year: 2005 ident: 9952_CR32 publication-title: J. Bioinform. Comput. Biol. doi: 10.1142/S0219720005001508 – volume: 30 start-page: 113 year: 1997 ident: 9952_CR14 publication-title: Theor. Comput. Sci. – ident: 9952_CR29 doi: 10.1007/3-540-44888-8_23 – ident: 9952_CR33 doi: 10.1007/978-3-642-02270-8_27 – volume: 8 start-page: 1400 issue: 5 year: 2011 ident: 9952_CR7 publication-title: IEEE/ACM Trans. Comput. Biol. Bioinform. doi: 10.1109/TCBB.2011.21 – ident: 9952_CR1 doi: 10.1089/cmb.2009.0098 – volume: 26 start-page: 141 issue: 2 year: 2006 ident: 9952_CR12 publication-title: Combinatorica doi: 10.1007/s00493-006-0011-4 – ident: 9952_CR19 doi: 10.1007/978-3-540-27801-6_10 – ident: 9952_CR3 doi: 10.1007/3-540-63220-4_63 – ident: 9952_CR25 doi: 10.1007/978-3-642-33293-7_2 – volume: 185 start-page: 41 year: 2003 ident: 9952_CR20 publication-title: Inf. Comput. doi: 10.1016/S0890-5401(03)00057-9 – volume: 16 start-page: 419 year: 2004 ident: 9952_CR28 publication-title: INFORMS J. Comput. doi: 10.1287/ijoc.1040.0090 – ident: 9952_CR35 – ident: 9952_CR13 doi: 10.1007/978-3-642-38768-5_10 – volume: 49 start-page: 157 issue: 2 year: 2002 ident: 9952_CR21 publication-title: J. ACM doi: 10.1145/506147.506150 – volume: 37 start-page: 25 year: 2003 ident: 9952_CR17 publication-title: Algorithmica doi: 10.1007/s00453-003-1028-3 – ident: 9952_CR2 doi: 10.1007/978-3-642-00727-9_15 – ident: 9952_CR27 doi: 10.1109/CSB.2003.1227407 – ident: 9952_CR11 doi: 10.1007/978-3-540-45077-1_20 |
| SSID | ssj0012796 |
| Score | 2.1215937 |
| Snippet | Given a set
S
=
{
s
1
,
s
2
,
…
,
s
n
}
of strings of equal length
L
and an integer
d
, the
closest string problem
(CSP) requires the computation of a string
s... |
| SourceID | crossref springer |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 466 |
| SubjectTerms | Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Mathematics of Computing Theory of Computation |
| Title | Randomized Fixed-Parameter Algorithms for the Closest String Problem |
| URI | https://link.springer.com/article/10.1007/s00453-014-9952-y |
| Volume | 74 |
| WOSCitedRecordID | wos000367622200016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: Springer Journals New Starts & Take-Overs Collection customDbUrl: eissn: 1432-0541 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012796 issn: 0178-4617 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB60evBifWJ9sQdPykLcTXazx1ItnkqxKr2F7KMaaBNpolh_vbtpEiiooPdJGGZ3Mt_mm50P4EKzWLGJEji06YD9ifCwiAXFiki3JspxeaXYBB8MwvFYDKt73Hnd7V5TkuWXurns5tCH6_3xsRABwYt12AjcBCR3RB89NdQB4aUol5Odx76tzzWV-d0rVovRKhNaFph--1-u7cB2hSdRd7kBdmHNpHvQrrUaUJW6-3BzH6c6myWfRqN-8mE0HsauL8sZdafP2TwpXmY5shAWWUiIetMst_UCjQrnCBouZWcO4LF_-9C7w5WCAlY-8Qt8zRSnUtmKY_2SnlbGHueohRBMcGIkF7HHic-MlrZU8pDp2KK7kGpJDQtNENJDaKVZao4A8diuqgoMJ1Q5rlVO3Kh5JgkVHtEB74BXhzJS1Xhxp3IxjZrByGWUIhulyEUpWnTgsnnkdTlb4zfjqzr2UZVm-c_Wx3-yPoEti4OqPyun0Crmb-YMNtV7keTz83J7fQGDdcmJ |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFA46BX1xXnFe8-CTEqhJmzSPYzoU5xhuyt5Kc5kWtlbWKs5fb9K1hYEK-n5aDic5PV_6nZwPgDNFQ0lHkiPfpANyR9xBPOQESSzsmkjL5eViE6zb9YdD3ivucadlt3tJSeZf6uqym0UftvfHRZx7GM2WwYpr52zbI3r_qaIOMMtFuazsPHJNfS6pzO9esViMFpnQvMC06_9ybRNsFHgSNucbYAss6Xgb1EutBlik7g64eghjlUyiT61gO_rQCvVC25dljZrj52QaZS-TFBoICw0khK1xkpp6AfuZdQT25rIzu-CxfT1o3aBCQQFJF7sZuqSSESFNxTF-CUdJbY5zxEAIyhnWgvHQYdilWglTKplPVWjQnU-UIJr62vPJHqjFSaz3AWShWVXpaYaJtFyrGNlR81Rgwh2sPNYAThnKQBbjxa3KxTioBiPnUQpMlAIbpWDWAOfVI6_z2Rq_GV-UsQ-KNEt_tj74k_UpWLsZ3HeCzm337hCsG0xU_GU5ArVs-qaPwap8z6J0epJvtS8ALsxt |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFA46RXxxXnFe8-CTElbTNmkex-ZQlFE2lb2VNkm1sLVjreL89Sa9wUAF8f2kHM6F86Xn5HwAXAjicxJyhhyVDsgKmYGYz0zEcaB9wnUvLyeboIOBMx4zt-Q5Tatp96olWbxp0Fua4qw9E2G7fvimkYieA7IQYzZGi1WwZqmLjA7x4ei5biNgmhN0aQp6ZKlaXbU1v_vEcmFa7ormxabf_Lea22CrxJmwUwTGDliR8S5oVhwOsEzpPdAb-rFIptGnFLAffUiBXF_Pa2mhzuQlmUfZ6zSFCtpCBRVhd5Kkqo7AUaaVgm5BR7MPnvo3j91bVDIrIG5hK0PXhFMz4KoSKb0CQ3CprnmmghaEUSwDynyDYotIEagSSh0ifIX6HFMEpiSOtB3zADTiJJaHAFJfeZvbkmKT6x5sEOoV9CTAJjOwsGkLGJVZPV6uHdfsFxOvXpicW8lTVvK0lbxFC1zWR2bFzo3fhK8qP3hl-qU_Sx_9SfocbLi9vvdwN7g_BpsKKpU_X05AI5u_yVOwzt-zKJ2f5VH3BVRq1VE |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Randomized+Fixed-Parameter+Algorithms+for+the+Closest+String+Problem&rft.jtitle=Algorithmica&rft.au=Chen%2C+Zhi-Zhong&rft.au=Ma%2C+Bin&rft.au=Wang%2C+Lusheng&rft.date=2016-01-01&rft.issn=0178-4617&rft.eissn=1432-0541&rft.volume=74&rft.issue=1&rft.spage=466&rft.epage=484&rft_id=info:doi/10.1007%2Fs00453-014-9952-y&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00453_014_9952_y |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-4617&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-4617&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-4617&client=summon |