{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:00:54Z","timestamp":1725555654404},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642126826"},{"type":"electronic","value":"9783642126833"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12683-3_25","type":"book-chapter","created":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T19:00:43Z","timestamp":1272999643000},"page":"384-396","source":"Crossref","is-referenced-by-count":1,"title":["Seed Design Framework for Mapping SOLiD Reads"],"prefix":"10.1007","author":[{"given":"Laurent","family":"No\u00e9","sequence":"first","affiliation":[]},{"given":"Marta","family":"G\u00eerdea","sequence":"additional","affiliation":[]},{"given":"Gregory","family":"Kucherov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","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\u00a018(3), 440\u2013445 (2002)","journal-title":"Bioinformatics"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"No\u00e9, L., Kucherov, G.: YASS: enhancing the sensitivity of DNA similarity search. Nucleic Acids Research\u00a033(Web Server Issue), W540\u2013W543 (2005)","DOI":"10.1093\/nar\/gki478"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"1851","DOI":"10.1101\/gr.078212.108","volume":"18","author":"H. Li","year":"2008","unstructured":"Li, H., Ruan, J., Durbin, R.: Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Research\u00a018, 1851\u20131858 (2008)","journal-title":"Genome Research"},{"key":"25_CR4","unstructured":"Str\u00f6mberg, M., Lee, W.P.: MOSAIK read alignment and assembly program (2009), http:\/\/bioinformatics.bc.edu\/marthlab\/Mosaik"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-642-04241-6_21","volume-title":"Algorithms in Bioinformatics","author":"E. Rivals","year":"2009","unstructured":"Rivals, E., Salmela, L., Kiiskinen, P., Kalsi, P., Tarhio, J.: MPSCAN: Fast localisation of multiple reads in genomes. In: Salzberg, S.L., Warnow, T. (eds.) Algorithms in Bioinformatics. LNCS, vol.\u00a05724, pp. 246\u2013260. Springer, Heidelberg (2009)"},{"issue":"7","key":"25_CR6","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1093\/bioinformatics\/btp087","volume":"25","author":"D. Campagna","year":"2009","unstructured":"Campagna, D., Albiero, A., Bilardi, A., Caniato, E., Forcato, C., Manavski, S., Vitulo, N., Valle, G.: PASS: a program to align short sequences. Bioinformatics\u00a025(7), 967\u2013968 (2009)","journal-title":"Bioinformatics"},{"issue":"19","key":"25_CR7","doi-asserted-by":"publisher","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\u00a025(19), 2514\u20132521 (2009)","journal-title":"Bioinformatics"},{"issue":"9","key":"25_CR8","doi-asserted-by":"publisher","first-page":"1646","DOI":"10.1101\/gr.088823.108","volume":"19","author":"D. Weese","year":"2009","unstructured":"Weese, D., Emde, A., Rausch, T., D\u00f6ring, A., Reinert, K.: RazerS\u2013fast read mapping with sensitivity control. Genome Research\u00a019(9), 1646\u20131654 (2009)","journal-title":"Genome Research"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Rumble, S.M., Lacroute, P., Dalca, A.V., Fiume, M., Sidow, A., Brudno, M.: SHRiMP: Accurate mapping of short color-space reads. PLoS Comp. Biol.\u00a05(5) (2009)","DOI":"10.1371\/journal.pcbi.1000386"},{"issue":"21","key":"25_CR10","doi-asserted-by":"publisher","first-page":"2431","DOI":"10.1093\/bioinformatics\/btn416","volume":"24","author":"H. Lin","year":"2008","unstructured":"Lin, H., Zhang, Z., Zhang, M., Ma, B., Li, M.: ZOOM! zillions of oligos mapped. Bioinformatics\u00a024(21), 2431\u20132437 (2008)","journal-title":"Bioinformatics"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Langmead, B., Trapnell, C., Pop, M., Salzberg, S.: Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biology\u00a010(3) (2009)","DOI":"10.1186\/gb-2009-10-3-r25"},{"issue":"14","key":"25_CR12","doi-asserted-by":"publisher","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","volume":"25","author":"H. Li","year":"2009","unstructured":"Li, H., Durbin, R.: Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics\u00a025(14), 1754\u20131760 (2009)","journal-title":"Bioinformatics"},{"issue":"15","key":"25_CR13","doi-asserted-by":"publisher","first-page":"1966","DOI":"10.1093\/bioinformatics\/btp336","volume":"25","author":"R. Li","year":"2009","unstructured":"Li, R., Yu, C., Li, Y., Lam, T., Yiu, S., Kristiansen, K., Wang, J.: SOAP2: an improved ultrafast tool for short read alignment. Bioinformatics\u00a025(15), 1966\u20131967 (2009)","journal-title":"Bioinformatics"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Hoffmann, S., Otto, C., Kurtz, S., Sharma, C., Khaitovich, P., Stadler, P., Hackermuller, J.: Fast mapping of short sequences with mismatches, insertions and deletions using index structures. PLoS Comp. Biol.\u00a05(9) (2009)","DOI":"10.1371\/journal.pcbi.1000502"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Homer, N., Merriman, B., Nelson, S.F.: BFAST: an alignment tool for large scale genome resequencing. PLoS One\u00a04(11) (2009)","DOI":"10.1371\/journal.pone.0007767"},{"issue":"23","key":"25_CR16","doi-asserted-by":"publisher","first-page":"2776","DOI":"10.1093\/bioinformatics\/btn512","volume":"24","author":"B. Ondov","year":"2008","unstructured":"Ondov, B., Varadarajan, A., Passalacqua, K., Bergman, N.: Efficient mapping of Applied Biosystems SOLiD sequence data to a reference genome for functional genomic applications. Bioinformatics\u00a024(23), 2776\u20132777 (2008)","journal-title":"Bioinformatics"},{"issue":"13","key":"25_CR17","doi-asserted-by":"publisher","first-page":"1530","DOI":"10.1093\/bioinformatics\/btn223","volume":"24","author":"K. Prufer","year":"2008","unstructured":"Prufer, K., Stenzel, U., Dannemann, M., Green, R., Lachmann, M., Kelso, J.: PatMaN: rapid alignment of short sequences to large databases. Bioinformatics\u00a024(13), 1530\u20131531 (2008)","journal-title":"Bioinformatics"},{"issue":"7218","key":"25_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1038\/nature07517","volume":"456","author":"D. Bentley","year":"2008","unstructured":"Bentley, D., Balasubramanian, S., Swerdlow, H., Smith, G., Milton, J., Brown, C., Hall, K., Evers, D., Barnes, C., Bignell, H., et al.: Accurate whole human genome sequencing using reversible terminator chemistry. Nature\u00a0456(7218), 53\u201359 (2008)","journal-title":"Nature"},{"issue":"1","key":"25_CR19","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/TCBB.2005.12","volume":"2","author":"G. Kucherov","year":"2005","unstructured":"Kucherov, G., No\u00e9, L., Roytberg, M.: Multiseed lossless filtration. IEEE Transactions on Computational Biology and Bioinformatics\u00a02(1), 51\u201361 (2005)","journal-title":"IEEE Transactions on Computational Biology and Bioinformatics"},{"issue":"2","key":"25_CR20","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1142\/S0219720006001977","volume":"4","author":"G. Kucherov","year":"2006","unstructured":"Kucherov, G., No\u00e9, L., Roytberg, M.: A unifying framework for seed sensitivity and its application to subset seeds. J. Bioinform. Comput. Biol.\u00a04(2), 553\u2013570 (2006)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"25_CR21","unstructured":"ABI: A theoretical understanding of 2 base color codes and its application to annotation, error detection, and error correction. methods for annotating 2 base color encoded reads in the SOLiDTMsystem (2008)"},{"key":"25_CR22","unstructured":"ABI: The SOLiDTM3 system. enabling the Next Generation of Science (2009)"},{"issue":"3","key":"25_CR23","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1101\/gr.8.3.186","volume":"8","author":"B. Ewing","year":"1998","unstructured":"Ewing, B., Green, P.: Base-calling of automated sequencer traces using phred. II. error probabilities. Genome Research\u00a08(3), 186\u2013194 (1998)","journal-title":"Genome Research"},{"issue":"3","key":"25_CR24","doi-asserted-by":"publisher","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.\u00a02(3), 417\u2013439 (2004)","journal-title":"J. Bioinform. Comput. Biol."},{"issue":"6","key":"25_CR25","doi-asserted-by":"publisher","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. Journal of Computational Biology\u00a012(6), 847\u2013861 (2005)","journal-title":"Journal of Computational Biology"},{"key":"25_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/3-540-44888-8_4","volume-title":"Combinatorial Pattern Matching","author":"B. Brejov\u00e1","year":"2003","unstructured":"Brejov\u00e1, B., Brown, D.G., Vinar, T.: Optimal spaced seeds for hidden markov models, with application to homologous coding regions. In: Baeza-Yates, R., Ch\u00e1vez, E., Crochemore, M. (eds.) CPM 2003. LNCS, vol.\u00a02676, pp. 42\u201354. Springer, Heidelberg (2003)"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Zhou, L., Stanton, J., Florea, L.: Universal seeds for cDNA-to-genome comparison. BMC Bioinformatics\u00a09(36) (2008)","DOI":"10.1186\/1471-2105-9-36"},{"issue":"10","key":"25_CR28","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1089\/cmb.2007.0209","volume":"15","author":"J. Yang","year":"2008","unstructured":"Yang, J., Zhang, L.: Run probabilities of seed-like patterns and identifying good transition seeds. Journal of Computational Biology\u00a015(10), 1295\u20131313 (2008)","journal-title":"Journal of Computational Biology"},{"key":"25_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-76336-9_18","volume-title":"Implementation and Application of Automata","author":"G. Kucherov","year":"2007","unstructured":"Kucherov, G., No\u00e9, L., Roytberg, M.: Subset seed automaton. In: Holub, J., \u017d\u010f\u00e1rek, J. (eds.) CIAA 2007. LNCS, vol.\u00a04783, pp. 180\u2013191. Springer, Heidelberg (2007)"},{"key":"25_CR30","unstructured":"Kucherov, G., No\u00e9, L., Roytberg, M.: Iedera: subset seed design tool (2009), http:\/\/bioinfo.lifl.fr\/yass\/iedera"},{"issue":"3","key":"25_CR31","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. Discrete Applied Mathematics\u00a0138(3), 253\u2013263 (2004); preliminary version in 2002","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR32","first-page":"67","volume-title":"Proceedings of the 7th Annual International Conference on Computational Molecular Biology (RECOMB)","author":"J. Buhler","year":"2003","unstructured":"Buhler, J., Keich, U., Sun, Y.: Designing seeds for similarity search in genomic DNA. In: Proceedings of the 7th Annual International Conference on Computational Molecular Biology (RECOMB), pp. 67\u201375. ACM Press, New York (2003)"},{"issue":"1,2","key":"25_CR33","first-page":"51","volume":"56","author":"S. Burkhardt","year":"2001","unstructured":"Burkhardt, S., K\u00e4rkk\u00e4inen, J.: Better filtering with gapped q-grams. CPM 2001\u00a056(1,2), 51\u201370 (2003); Preliminary version in CPM 2001","journal-title":"CPM"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12683-3_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:56:23Z","timestamp":1606168583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12683-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642126826","9783642126833"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12683-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}