{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:57:06Z","timestamp":1755035826663,"version":"3.37.3"},"reference-count":92,"publisher":"Springer Science and Business Media LLC","issue":"1","funder":[{"DOI":"10.13039\/100012950","name":"INRIA","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100012950","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1186\/s13015-017-0092-1","type":"journal-article","created":{"date-parts":[[2017,2,14]],"date-time":"2017-02-14T13:29:55Z","timestamp":1487078995000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Best hits of 11110110111: model-free selection and parameter-free sensitivity calculation of spaced seeds"],"prefix":"10.1186","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1170-8376","authenticated-orcid":false,"given":"Laurent","family":"No\u00e9","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,14]]},"reference":[{"issue":"3","key":"92_CR1","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1093\/bioinformatics\/btn643","volume":"25","author":"DYF Mak","year":"2009","unstructured":"Mak DYF, Benson G. All hits all the time: parameter free calculation of seed sensitivity. Bioinformatics. 2009;25(3):302\u20138.","journal-title":"Bioinformatics"},{"issue":"1","key":"92_CR2","doi-asserted-by":"crossref","first-page":"S37","DOI":"10.1186\/1471-2105-11-S1-S37","volume":"11","author":"WH Chung","year":"2010","unstructured":"Chung WH, Park SB. Hit integration for identifying optimal spaced seeds. BMC Bioinform. 2010;11(1):S37.","journal-title":"BMC Bioinform"},{"issue":"3","key":"92_CR3","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1093\/bioinformatics\/18.3.440","volume":"18","author":"B Ma","year":"2002","unstructured":"Ma B, Tromp J, Li M. PatternHunter: faster and more sensitive homology search. Bioinformatics. 2002;18(3):440\u20135.","journal-title":"Bioinformatics"},{"issue":"1\u2014-2","key":"92_CR4","first-page":"51","volume":"56","author":"S Burkhardt","year":"2002","unstructured":"Burkhardt S, K\u00e4rkk\u00e4inen J. Better filtering with gapped $$q$$ q -grams. Fund Inform. 2002;56(1\u2014-2):51\u201370.","journal-title":"Fund Inform"},{"issue":"3","key":"92_CR5","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1016\/j.jcss.2004.12.008","volume":"70","author":"B Brejov\u00e1","year":"2005","unstructured":"Brejov\u00e1 B, Brown DG, Vina\u0159 T. Vector seeds: an extension to spaced seeds. J Comput Syst Sci. 2005;70(3):364\u201380.","journal-title":"J Comput Syst Sci"},{"key":"92_CR6","doi-asserted-by":"crossref","unstructured":"Burkhardt S, K\u00e4rkk\u00e4inen J. One-gapped $$q$$ q -gram filters for Levenshtein distance. Proceedings of the 13th symposium on combinatorial pattern matching (CPM), vol 2373, Lecture Notes in Computer Science Fukuoka (Japan). Berlin: Springer; 2002. p. 225\u201334.","DOI":"10.1007\/3-540-45452-7_19"},{"issue":"14","key":"92_CR7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1093\/bioinformatics\/btl263","volume":"22","author":"DYF Mak","year":"2006","unstructured":"Mak DYF, Gelfand Y, Benson G. Indel seeds for homology search. Bioinformatics. 2006;22(14):341\u20139.","journal-title":"Bioinformatics"},{"issue":"20","key":"92_CR8","doi-asserted-by":"crossref","first-page":"3837","DOI":"10.1007\/s11434-009-0531-6","volume":"54","author":"K Chen","year":"2009","unstructured":"Chen K, Zhu Q, Yang F, Tang D. An efficient way of finding good indel seeds for local homology search. Chin Sci Bull. 2009;54(20):3837\u201342.","journal-title":"Chin Sci Bull"},{"issue":"2","key":"92_CR9","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s00453-007-0062-y","volume":"48","author":"M Cs\u0171r\u00f6s","year":"2007","unstructured":"Cs\u0171r\u00f6s M, Ma B. Rapid homology search with neighbor seeds. Algorithmica. 2007;48(2):187\u2013202.","journal-title":"Algorithmica"},{"issue":"6","key":"92_CR10","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1093\/bioinformatics\/btp054","volume":"25","author":"L Ilie","year":"2009","unstructured":"Ilie L, Ilie S. Fast computation of neighbor seeds. Bioinformatics. 2009;25(6):822\u20133.","journal-title":"Bioinformatics"},{"key":"92_CR11","first-page":"176","volume":"14","author":"W Chen","year":"2003","unstructured":"Chen W, Sung WK. On half gapped seed. Genome Inform. 2003;14:176\u201385.","journal-title":"Genome Inform"},{"key":"92_CR12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1186\/1471-2105-5-149","volume":"5","author":"L No\u00e9","year":"2004","unstructured":"No\u00e9 L, Kucherov G. Improved hit criteria for DNA local alignment. BMC Bioinform. 2004;5:149.","journal-title":"BMC Bioinform"},{"issue":"10","key":"92_CR13","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1089\/cmb.2007.0209","volume":"5","author":"J Yang","year":"2008","unstructured":"Yang J, Zhang L. Run probabilities of seed-like patterns and identifying good transition seeds. J Comput Biol. 2008;5(10):1295\u2013313.","journal-title":"J Comput Biol"},{"key":"92_CR14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1186\/1471-2105-9-36","volume":"9","author":"L Zhou","year":"2008","unstructured":"Zhou L, Stanton J, Florea L. Universal seeds for cDNA-to-genome comparison. BMC Bioinform. 2008;9:36.","journal-title":"BMC Bioinform"},{"issue":"7","key":"92_CR15","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1093\/nar\/gku104","volume":"42","author":"MC Frith","year":"2014","unstructured":"Frith MC, No\u00e9 L. Improved search heuristics find 20 000 new alignments between human and mouse genomes. Nucleic Acids Res. 2014;42(7):59.","journal-title":"Nucleic Acids Res"},{"issue":"3","key":"92_CR16","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1142\/S0219720004000661","volume":"2","author":"M Li","year":"2004","unstructured":"Li M, Ma B, Kisman D, Tromp J. PatternHunter II: highly sensitive and fast homology search. J Bioinform Comput Biol. 2004;2(3):417\u201339.","journal-title":"J Bioinform Comput Biol"},{"issue":"6","key":"92_CR17","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1089\/cmb.2005.12.847","volume":"12","author":"Y Sun","year":"2005","unstructured":"Sun Y, Buhler J. Designing multiple simultaneous seeds for DNA similarity search. J Comput Biol. 2005;12(6):847\u201361.","journal-title":"J Comput Biol"},{"issue":"1","key":"92_CR18","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/TCBB.2005.12","volume":"2","author":"G Kucherov","year":"2005","unstructured":"Kucherov G, No\u00e9 L, Roytberg MA. Multiseed lossless filtration. IEEE\/ACM Trans Comput Biol Bioinform. 2005;2(1):51\u201361.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"7","key":"92_CR19","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1016\/j.jcss.2007.03.007","volume":"73","author":"M Farach-Colton","year":"2007","unstructured":"Farach-Colton M, Landau GM, Cenk Sahinalp S, Tsur D. Optimal spaced seeds for faster approximate string matching. J Comput Syst Sci. 2007;73(7):1035\u201344.","journal-title":"J Comput Syst Sci"},{"issue":"3","key":"92_CR20","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1101\/gr.113985.110","volume":"21","author":"SM Kie\u0142basa","year":"2011","unstructured":"Kie\u0142basa SM, Wan R, Sato K, Horton P, Frith MC. Adaptive seeds tame genomic sequence comparison. Genome Res. 2011;21(3):487\u201393.","journal-title":"Genome Res"},{"key":"92_CR21","doi-asserted-by":"crossref","unstructured":"Peterlongo P, Pisanti N, Boyer F, Sagot MF. Lossless filter for finding long multiple approximate repetitions using a new data structure, the bi-factor array. In: Consens M, Navarro G, editor. Proceedings of the 12th international conference, on string processing and information retrieval (SPIRE). Lecture Notes in Computer Science, vol 3772. Buenos Aires; 2005. p. 179\u2013190.","DOI":"10.1007\/11575832_20"},{"key":"92_CR22","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-3-642-16321-0_37","volume-title":"Proceedings of the 17th international\u2014symposium on string processing and information retrieval (SPIRE)","author":"M Crochemore","year":"2010","unstructured":"Crochemore M, Tischler G. The gapped suffix array: a new index structure for fast approximate matching. In: Chavez E, Lonardi S, editors. Proceedings of the 17th international\u2014symposium on string processing and information retrieval (SPIRE), vol. 6393., Lecture notes in computer scienceLos Cabos: Springer; 2010. p. 359\u201364."},{"key":"92_CR23","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1007\/978-3-642-25591-5_78","volume-title":"Proceedings of the 22nd international symposium on algorithms and computation (ISAAC)","author":"T Onodera","year":"2011","unstructured":"Onodera T, Shibuya T. An index structure for spaced seed search. In: Asano T, Nakano S-I, Okamoto Y, Watanabe O, editors. Proceedings of the 22nd international symposium on algorithms and computation (ISAAC), vol. 7074., Lecture notes in computer scienceYokohama (Japan): Springer; 2011. p. 764\u201372."},{"key":"92_CR24","unstructured":"Gagie T, Manzini G, Valenzuela D. Compressed spaced suffix arrays. In: Proceedings of the 2nd international conference on algorithms for big data (ICABD). CEUR-WS, vol 1146. Palermo; 2014. p. 37\u201345."},{"issue":"2","key":"92_CR25","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1093\/bib\/bbt081","volume":"15","author":"AMS Shrestha","year":"2014","unstructured":"Shrestha AMS, Frith MC, Horton P. A bioinformatician\u2019s guide to the forefront of suffix array construction algorithms. Brief Bioinform. 2014;15(2):138\u201354.","journal-title":"Brief Bioinform"},{"key":"92_CR26","first-page":"196591","volume":"2015","author":"I Birol","year":"2015","unstructured":"Birol I, Chu J, Mohamadi H, Jackman SD, Raghavan K, Vandervalk BP, Raymond A, Warren RL. Spaced seed data structures for de novo assembly. Int J Genom. 2015;2015:196591.","journal-title":"Int J Genom"},{"issue":"3","key":"92_CR27","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0166-218X(03)00382-2","volume":"138","author":"U Keich","year":"2004","unstructured":"Keich U, Li M, Ma B, Tromp J. On spaced seeds for similarity search. Discret Appl Math. 2004;138(3):253\u201363.","journal-title":"Discret Appl Math"},{"issue":"5","key":"92_CR28","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1016\/j.jcss.2007.10.001","volume":"74","author":"F Nicolas","year":"2008","unstructured":"Nicolas F, Rivals \u00c9. Hardness of optimal spaced seed design. J Comput Syst Sci. 2008;74(5):831\u201349.","journal-title":"J Comput Syst Sci"},{"issue":"19","key":"92_CR29","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1016\/j.ipl.2009.07.008","volume":"109","author":"B Ma","year":"2009","unstructured":"Ma B, Yao H. Seed optimization for i.i.d. similarities is no easier than optimal Golomb ruler design. Inf Process Lett. 2009;109(19):1120\u20134.","journal-title":"Inf Process Lett"},{"key":"92_CR30","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1101\/gr.809403","volume":"13","author":"S Schwartz","year":"2003","unstructured":"Schwartz S, Kent WJ, Smit A, Zhang Z, Baertsch R, Hardison RC, Haussler D, Miller W. Human-mouse alignments with BLASTZ. Genome Res. 2003;13:103\u20137.","journal-title":"Genome Res"},{"key":"92_CR31","doi-asserted-by":"crossref","unstructured":"Darling AE, Treangen TJ, Zhang L, Kuiken C, Messeguer X, Perna NT. Procrastination leads to efficient filtration for local multiple alignment. Proceedings of the 6th international workshop on algorithms in bioinformatics (WABI), vol 4175. Lecture notes in bioinformatics. Z\u00fcrich: Springer; 2006. p. 126\u201337.","DOI":"10.1007\/11851561_12"},{"key":"92_CR32","unstructured":"Harris RS. Improved pairwise alignment of genomic dna. Ph.d. thesis, The Pennsylvania State University; 2007"},{"issue":"21","key":"92_CR33","doi-asserted-by":"crossref","first-page":"2431","DOI":"10.1093\/bioinformatics\/btn416","volume":"24","author":"H Lin","year":"2008","unstructured":"Lin H, Zhang Z, Zhang MQ, Ma B, Li M. ZOOM! Zillions Of Oligos Mapped. Bioinformatics. 2008;24(21):2431\u20137.","journal-title":"Bioinformatics"},{"issue":"5","key":"92_CR34","doi-asserted-by":"crossref","first-page":"1000386","DOI":"10.1371\/journal.pcbi.1000386","volume":"5","author":"SM Rumble","year":"2009","unstructured":"Rumble SM, Lacroute P, Dalca AV, Fiume M, Sidow A, Brudno M. SHRiMP: accurate mapping of short color-space reads. PLoS Comp Biol. 2009;5(5):1000386.","journal-title":"PLoS Comp Biol"},{"issue":"19","key":"92_CR35","doi-asserted-by":"crossref","first-page":"2514","DOI":"10.1093\/bioinformatics\/btp486","volume":"25","author":"Y Chen","year":"2009","unstructured":"Chen Y, Souaiaia T, Chen T. PerM: efficient mapping of short sequencing reads with periodic full sensitive spaced seeds. Bioinformatics. 2009;25(19):2514\u201321.","journal-title":"Bioinformatics"},{"issue":"10","key":"92_CR36","doi-asserted-by":"crossref","first-page":"1397","DOI":"10.1089\/cmb.2010.0005","volume":"17","author":"E Giladi","year":"2010","unstructured":"Giladi E, Healy J, Myers G, Hart C, Kapranov P, Lipson D, Roels S, Thayer E, Letovsky S. Error tolerant indexing and alignment of short reads with covering template families. J Comput Biol. 2010;17(10):1397\u2013411.","journal-title":"J Comput Biol"},{"issue":"7","key":"92_CR37","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1093\/bioinformatics\/btr046","volume":"27","author":"M David","year":"2011","unstructured":"David M, Dzamba M, Lister D, Ilie L, Brudno M. SHRiMP2: Sensitive yet practical short read mapping. Bioinformatics. 2011;27(7):1011\u20132.","journal-title":"Bioinformatics"},{"key":"92_CR38","doi-asserted-by":"crossref","first-page":"11307","DOI":"10.1038\/ncomms11307","volume":"7","author":"I Sovi\u0107","year":"2016","unstructured":"Sovi\u0107 I, \u0160iki\u0107 M, Wilm A, Fenlon SN, Chen S, Nagarajan N. Fast and sensitive mapping of nanopore sequencing reads with GraphMap. Nat Commun. 2016;7:11307.","journal-title":"Nat Commun"},{"issue":"4","key":"92_CR39","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1089\/cmb.2004.11.753","volume":"11","author":"FP Preparata","year":"2005","unstructured":"Preparata FP, Oliver JS. DNA sequencing by hybridization using semi-degenerate bases. J Comput Biol. 2005;11(4):753\u201365.","journal-title":"J Comput Biol"},{"key":"92_CR40","doi-asserted-by":"crossref","unstructured":"Tsur D. Optimal probing patterns for sequencing by hybridization. Proceedings of the 6th international workshop on algorithms in bioinformatics (WABI), vol 4175. Lecture notes in bioinformatics. Z\u00fcrich: Springer; 2006. p. 366\u201375.","DOI":"10.1007\/11851561_34"},{"issue":"10","key":"92_CR41","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1093\/bioinformatics\/btm114","volume":"23","author":"S Feng","year":"2007","unstructured":"Feng S, Tillier ERM. A fast and flexible approach to oligonucleotide probe design for genomes and gene families. Bioinformatics. 2007;23(10):1195\u2013202.","journal-title":"Bioinformatics"},{"issue":"Suppl 3","key":"92_CR42","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1186\/1471-2164-10-S3-S3","volume":"10","author":"W-H Chung","year":"2009","unstructured":"Chung W-H, Park S-B. An empirical study of choosing efficient discriminative seeds for oligonucleotide design. BMC Genom. 2009;10(Suppl 3):3.","journal-title":"BMC Genom"},{"key":"92_CR43","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1186\/1471-2164-12-280","volume":"12","author":"L Ilie","year":"2011","unstructured":"Ilie L, Ilie S, Khoshraftar S, Mansouri Bigvand A. Seeds for effective oligonucleotide design. BMC Genom. 2011;12:280.","journal-title":"BMC Genom"},{"key":"92_CR44","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1186\/1471-2105-14-69","volume":"14","author":"L Ilie","year":"2013","unstructured":"Ilie L, Mohamadi H, Brian\u00a0Golding G, Smyth WF. BOND: Basic Oligo Nucleotide Design. BMC Bioinform. 2013;14:69.","journal-title":"BMC Bioinform"},{"issue":"4","key":"92_CR45","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1093\/bioinformatics\/bti035","volume":"21","author":"D Kisman","year":"2005","unstructured":"Kisman D, Li M, Ma B, Li W. tPatternhunter: gapped, fast and sensitive translated homology search. Bioinformatics. 2005;21(4):542\u20134.","journal-title":"Bioinformatics"},{"issue":"1","key":"92_CR46","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/TCBB.2005.13","volume":"2","author":"DG Brown","year":"2005","unstructured":"Brown DG. Optimizing multiple seeds for protein homology search. IEEE\/ACM Trans Comput Biol Bioinform. 2005;2(1):23\u201338.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"3","key":"92_CR47","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1109\/TCBB.2009.4","volume":"6","author":"MA Roytberg","year":"2009","unstructured":"Roytberg MA, Gambin A, No\u00e9 L, Lasota S, Furletova E, Szczurek E, Kucherov G. On subset seeds for protein alignment. IEEE\/ACM Trans Comput Biol Bioinform. 2009;6(3):483\u201394.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"92_CR48","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1186\/1471-2105-10-329","volume":"10","author":"V-H Nguyen","year":"2009","unstructured":"Nguyen V-H, Lavenier D. PLAST: parallel local alignment search tool for database comparison. BMC Bioinform. 2009;10:329.","journal-title":"BMC Bioinform"},{"issue":"3","key":"92_CR49","first-page":"495","volume":"60","author":"M Startek","year":"2012","unstructured":"Startek M, Lasota S, Sykulski M, Bu\u0142ak A, No\u00e9 L, Kucherov G, Gambin A. Efficient alternatives to PSI-BLAST. Bull Pol Acad Sci Tech Sci. 2012;60(3):495\u2013505.","journal-title":"Bull Pol Acad Sci Tech Sci"},{"issue":"2","key":"92_CR50","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/TCBB.2014.2306831","volume":"11","author":"W Li","year":"2014","unstructured":"Li W, Ma B, Zhang K. Optimizing spaced k-mer neighbors for efficient filtration in protein similarity search. IEEE\/ACM Trans Comput Biol Bioinform. 2014;11(2):398\u2013406.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"92_CR51","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1038\/nmeth.3176","volume":"12","author":"B Buchfink","year":"2014","unstructured":"Buchfink B, Xie C, Huson DH. Fast and sensitive protein alignment using DIAMOND. Nat Methods. 2014;12:59\u201360.","journal-title":"Nat Methods"},{"issue":"W1","key":"92_CR52","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1093\/nar\/gkv317","volume":"43","author":"P Somervuo","year":"2015","unstructured":"Somervuo P, Holm L. SANSparallel: interactive homology search against Uniprot. Nucleic Acids Res. 2015;43(W1):24\u20139.","journal-title":"Nucleic Acids Res"},{"key":"92_CR53","unstructured":"Petrov I, Brillet S, Drezen E, Quiniou S, Antin L, Durand P, Lavenier D. KLAST: fast and sensitive software to compare large genomic databanks on cloud. In: Proceedings world congress in computer science, computer engineering, and applied computing (WORLDCOMP). Las Vegas; 2015. p. 85\u201390."},{"key":"92_CR54","doi-asserted-by":"crossref","unstructured":"Yang IH, Wang SH, Chen YH, Huang PH, Ye L, Huang X, Chao KM. Efficient methods for generating optimal single and multiple spaced seeds. In: Proceedings of the IEEE 4th symposium on bioinformatics and bioengineering (BIBE). Taichung: IEEE Computer Society Press; 2004. p. 411\u201316.","DOI":"10.1109\/BIBE.2004.1317372"},{"issue":"22","key":"92_CR55","doi-asserted-by":"crossref","first-page":"2969","DOI":"10.1093\/bioinformatics\/btm422","volume":"23","author":"L Ilie","year":"2007","unstructured":"Ilie L, Ilie S. Multiple spaced seeds for homology search. Bioinformatics. 2007;23(22):2969\u201377.","journal-title":"Bioinformatics"},{"issue":"17","key":"92_CR56","doi-asserted-by":"crossref","first-page":"2433","DOI":"10.1093\/bioinformatics\/btr368","volume":"27","author":"L Ilie","year":"2011","unstructured":"Ilie L, Ilie S. SpEED: fast computation of sensitive spaced seeds. Bioinformatics. 2011;27(17):2433\u20134.","journal-title":"Bioinformatics"},{"key":"92_CR57","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1186\/1756-0500-5-123","volume":"5","author":"S Ilie","year":"2012","unstructured":"Ilie S. Efficient computation of spaced seeds. BMC Res Notes. 2012;5:123.","journal-title":"BMC Res Notes"},{"issue":"7","key":"92_CR58","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1016\/j.jcss.2013.03.002","volume":"79","author":"L Egidi","year":"2013","unstructured":"Egidi L, Manzini G. Better spaced seeds using quadratic residues. J Comput Syst Sci. 2013;79(7):1144\u201355.","journal-title":"J Comput Syst Sci"},{"key":"92_CR59","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.tcs.2013.12.007","volume":"522","author":"L Egidi","year":"2014","unstructured":"Egidi L, Manzini G. Design and analysis of periodic multiple seeds. Theor Comput Sci. 2014;522:62\u201376.","journal-title":"Theor Comput Sci"},{"issue":"2","key":"92_CR60","doi-asserted-by":"crossref","first-page":"187","DOI":"10.3233\/FI-2014-1009","volume":"131","author":"L Egidi","year":"2014","unstructured":"Egidi L, Manzini G. Spaced seeds design using perfect rulers. Fund Inform. 2014;131(2):187\u2013203.","journal-title":"Fund Inform"},{"issue":"4","key":"92_CR61","doi-asserted-by":"crossref","first-page":"1550011","DOI":"10.1142\/S0219720015500110","volume":"13","author":"L Egidi","year":"2015","unstructured":"Egidi L, Manzini G. Multiple seeds sensitivity using a single seed with threshold. J Bioinform Comput Biol. 2015;13(4):1550011.","journal-title":"J Bioinform Comput Biol"},{"issue":"4","key":"92_CR62","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1142\/S0219720004000326","volume":"1","author":"B Brejov\u00e1","year":"2004","unstructured":"Brejov\u00e1 B, Brown DG, Vina\u0159 T. Optimal spaced seeds for homologous coding regions. J Bioinform Comput Biol. 2004;1(4):595\u2013610.","journal-title":"J Bioinform Comput Biol"},{"issue":"3","key":"92_CR63","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.jcss.2004.12.003","volume":"70","author":"J Buhler","year":"2005","unstructured":"Buhler J, Keich U, Sun Y. Designing seeds for similarity search in genomic DNA. J Comput Syst Sci. 2005;70(3):342\u201363.","journal-title":"J Comput Syst Sci"},{"issue":"9","key":"92_CR64","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1089\/cmb.2005.12.1137","volume":"12","author":"FP Preparata","year":"2005","unstructured":"Preparata FP, Zhang L, Choi KP. Quick, practical selection of effective seeds for homology search. J Comput Biol. 2005;12(9):1137\u201352.","journal-title":"J Comput Biol"},{"issue":"2","key":"92_CR65","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1142\/S0219720006001977","volume":"4","author":"G Kucherov","year":"2006","unstructured":"Kucherov G, No\u00e9 L, Roytberg MA. A unifying framework for seed sensitivity and its application to subset seeds. J Bioinform Comput Biol. 2006;4(2):553\u201369.","journal-title":"J Bioinform Comput Biol"},{"issue":"3","key":"92_CR66","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1109\/tcbb.2007.1013","volume":"4","author":"L Zhang","year":"2007","unstructured":"Zhang L. Superiority of spaced seeds for homology search. IEEE\/ACM Trans Comput Biol Bioinform. 2007;4(3):496\u2013505.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"2","key":"92_CR67","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1089\/cmb.2006.0008","volume":"14","author":"Y Kong","year":"2007","unstructured":"Kong Y. Generalized correlation functions and their applications in selection of optimal multiple spaced seeds for homology search. J Comput Biol. 2007;14(2):238\u201354.","journal-title":"J Comput Biol"},{"key":"92_CR68","first-page":"708501","volume":"2010","author":"L No\u00e9","year":"2010","unstructured":"No\u00e9 L, G\u00eerdea M, Kucherov G. Designing efficient spaced seeds for SOLiD read mapping. Adv Bioinform. 2010;2010:708501.","journal-title":"Adv Bioinform"},{"issue":"6","key":"92_CR69","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1109\/TCBB.2012.109","volume":"9","author":"T Marschall","year":"2012","unstructured":"Marschall T, Herms I, Kaltenbach H-M, Rahmann S. Probabilistic arithmetic automata and their applications. IEEE\/ACM Trans Comput Biol Bioinform. 2012;9(6):1737\u201350.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"92_CR70","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10463-015-0530-0","volume":"69","author":"DEK Martin","year":"2017","unstructured":"Martin DEK, No\u00e9 L. Faster exact distributions of pattern statistics through sequential elimination of states. Ann Inst Stat Math. 2017;69:1\u201318.","journal-title":"Ann Inst Stat Math"},{"issue":"W1","key":"92_CR71","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1093\/nar\/gku398","volume":"42","author":"S Horwege","year":"2014","unstructured":"Horwege S, Lindner S, Boden M, Hatje K, Kollmar M, Leimeister C-A, Morgenstern B. Spaced words and kmacs: fast alignment-free sequence comparison based on inexact word matches. Nucleic Acids Res. 2014;42(W1):7\u201311.","journal-title":"Nucleic Acids Res"},{"issue":"14","key":"92_CR72","doi-asserted-by":"crossref","first-page":"1991","DOI":"10.1093\/bioinformatics\/btu177","volume":"30","author":"CA Leimeister","year":"2014","unstructured":"Leimeister CA, Boden M, Horwege S, Lindner S, et al., Morgenstern B. Fast alignment-free sequence comparison using spaced-word frequencies. Bioinformatics. 2014;30(14):1991\u20139.","journal-title":"Bioinformatics"},{"issue":"2","key":"92_CR73","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s00285-013-0705-3","volume":"69","author":"M Ghandi","year":"2014","unstructured":"Ghandi M, Mohammad-Noori M, Beer MA. Robust k-mer frequency estimation using gapped k-mers. J Math Biol. 2014;69(2):469\u2013500.","journal-title":"J Math Biol"},{"key":"92_CR74","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1186\/s13015-015-0032-x","volume":"10","author":"B Morgenstern","year":"2015","unstructured":"Morgenstern B, Zhu B, Horwege S, Leimeister CA. Estimating evolutionary distances between genomic sequences from spaced-word matches. Algorithms Mol Biol. 2015;10:5.","journal-title":"Algorithms Mol Biol"},{"issue":"22","key":"92_CR75","doi-asserted-by":"crossref","first-page":"3584","DOI":"10.1093\/bioinformatics\/btv419","volume":"31","author":"K B\u0159inda","year":"2015","unstructured":"B\u0159inda K, Sykulski M, Kucherov G. Spaced seeds improve k-mer based metagenomic classification. Bioinformatics. 2015;31(22):3584\u201392.","journal-title":"Bioinformatics"},{"key":"92_CR76","doi-asserted-by":"crossref","unstructured":"Ounit R, Lonardi S. Higher classification sensitivity of short metagenomic reads with CLARK-S. Bioinformatics. 2016.","DOI":"10.1093\/bioinformatics\/btw542"},{"key":"92_CR77","doi-asserted-by":"crossref","unstructured":"Duc DD, Dinh HQ, Dang TH, Laukens K, Hoang XH. AcoSeeD: an ant colony optimization for finding optimal spaced seeds in biological sequence search. Proceedings of the 8th international conference on swarm intelligence (ANTS), vol 7461. Lecture notes in computer science. Brussels: Springer; 2012. p. 204\u201311.","DOI":"10.1007\/978-3-642-32650-9_19"},{"key":"92_CR78","doi-asserted-by":"crossref","unstructured":"Do PT, Tran-Thi CG. An improvement of the overlap complexity in the spaced seed searching problem between genomic DNAs. In: Proceedings of the 2nd National Foundation for Science and Technology Development Conference on Information and Computer Science (NICS). Ho Chi Minh City; 2015. p. 271\u201376.","DOI":"10.1109\/NICS.2015.7302205"},{"issue":"2","key":"92_CR79","doi-asserted-by":"crossref","first-page":"85","DOI":"10.4018\/IJSSCI.2015040105","volume":"7","author":"Y Gheraibia","year":"2015","unstructured":"Gheraibia Y, Moussaoui A, Djenouri Y, Kabir S, Yin P-Y, Mazouzi S. Penguin search optimisation algorithm for finding optimal spaced seeds. Int J Softw Sci Comput Intell. 2015;7(2):85\u201399.","journal-title":"Int J Softw Sci Comput Intell"},{"issue":"10","key":"92_CR80","doi-asserted-by":"crossref","first-page":"1005107","DOI":"10.1371\/journal.pcbi.1005107","volume":"12","author":"L Hahn","year":"2016","unstructured":"Hahn L, Leimeister C-A, Ounit R, Lonardi S, Morgenstern B. rasbhari: optimizing spaced seeds for database searching, read mapping and alignment-free sequence comparison. PLoS Comput Biol. 2016;12(10):1005107.","journal-title":"PLoS Comput Biol"},{"issue":"7","key":"92_CR81","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1093\/bioinformatics\/bth037","volume":"20","author":"KP Choi","year":"2004","unstructured":"Choi KP, Zeng F, Zhang L. Good spaced seeds for homology search. Bioinformatics. 2004;20(7):1053\u20139.","journal-title":"Bioinformatics"},{"key":"92_CR82","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/978-3-540-76336-9_3","volume-title":"Proceedings of the 12th international conference on implementation and application of automata (CIAA)","author":"C Allauzen","year":"2007","unstructured":"Allauzen C, Riley M, Schalkwyk J, Skut W, Mohri M. OpenFst: a general and efficient weighted finite-state transducer library. In: Holub J, Zdarek J, editors. Proceedings of the 12th international conference on implementation and application of automata (CIAA), vol. 4783., Lecture notes in computer sciencePrague: Springer; 2007. p. 11\u201323."},{"key":"92_CR83","doi-asserted-by":"crossref","unstructured":"Mohri M. Weighted automata algorithms. In: Handbook of weighted automata. Berlin: Springer; 2009. p. 213\u201354.","DOI":"10.1007\/978-3-642-01492-5_6"},{"key":"92_CR84","unstructured":"Huang L. Dynamic programming algorithms in semiring and hypergraph frameworks. Technical report, University of Pennsylvania, Philadelphia, USA; 2006."},{"key":"92_CR85","volume-title":"Introduction to automata theory languages and computation","author":"JE Hopcroft","year":"2007","unstructured":"Hopcroft JE, Motwani R, Ullman JD. Introduction to automata theory languages and computation. 3rd ed. New York: Pearson; 2007.","edition":"3"},{"issue":"2","key":"92_CR86","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1214\/07-AOAS125","volume":"1","author":"JAD Aston","year":"2007","unstructured":"Aston JAD, Martin DEK. Distributions associated with general runs and patterns in hidden Markov models. Ann Appl Stat. 2007;1(2):585\u2013611.","journal-title":"Ann Appl Stat"},{"issue":"12","key":"92_CR87","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1089\/cmb.2014.0173","volume":"21","author":"L No\u00e9","year":"2014","unstructured":"No\u00e9 L, Martin DEK. A coverage criterion for spaced seeds and its applications to support vector machine string kernels and k-mer distances. J Comput Biol. 2014;21(12):947\u201363.","journal-title":"J Comput Biol"},{"key":"92_CR88","unstructured":"Kucherov G, No\u00e9 L, Roytberg MA. Iedera subset seed design tool. http:\/\/bioinfo.lifl.fr\/yass\/iedera.php ; 2016."},{"issue":"7","key":"92_CR89","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1016\/j.jcss.2007.03.008","volume":"73","author":"B Ma","year":"2007","unstructured":"Ma B, Li M. On the complexity of spaced seeds. J Comput Syst Sci. 2007;73(7):1024\u201334.","journal-title":"J Comput Syst Sci"},{"key":"92_CR90","doi-asserted-by":"crossref","unstructured":"Li M, Ma B, Zhang L. Superiority and complexity of the spaced seeds. In: Proceedings of the 17th symposium on discrete algorithms (SODA). Miami: ACM Press; 2006. p. 444\u201353.","DOI":"10.1145\/1109557.1109607"},{"issue":"2","key":"92_CR91","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/S0304-3975(01)00264-X","volume":"287","author":"P Nicod\u00e8me","year":"2002","unstructured":"Nicod\u00e8me P, Salvy B, Flajolet P. Motif statistics. Theor Comput Sci. 2002;287(2):593\u2013617.","journal-title":"Theor Comput Sci"},{"key":"92_CR92","doi-asserted-by":"crossref","unstructured":"Myers G. 1. What\u2019s behind blast. Models and algorithms for genome evolution, vol 19. Computational biology. Berlin: Springer; 2013. p. 3\u201315.","DOI":"10.1007\/978-1-4471-5298-9_1"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-017-0092-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T11:00:56Z","timestamp":1601636456000},"score":1,"resource":{"primary":{"URL":"http:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-017-0092-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,14]]},"references-count":92,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["92"],"URL":"https:\/\/doi.org\/10.1186\/s13015-017-0092-1","relation":{},"ISSN":["1748-7188"],"issn-type":[{"type":"electronic","value":"1748-7188"}],"subject":[],"published":{"date-parts":[[2017,2,14]]},"article-number":"1"}}