{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:24:47Z","timestamp":1742927087299,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540873600"},{"type":"electronic","value":"9783540873617"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87361-7_29","type":"book-chapter","created":{"date-parts":[[2008,9,17]],"date-time":"2008-09-17T12:59:00Z","timestamp":1221656340000},"page":"342-353","source":"Crossref","is-referenced-by-count":1,"title":["Detecting Repeat Families in Incompletely Sequenced Genomes"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Augusto","family":"Amgarten Quitzau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Stoye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1101\/gr.88502","volume":"12","author":"Z. Bao","year":"2002","unstructured":"Bao, Z., Eddy, S.R.: Automated de novo identification of repeat sequence families in sequenced genomes. Genome Res.\u00a012, 1269\u20131276 (2002)","journal-title":"Genome Res."},{"issue":"7","key":"29_CR2","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1093\/bioinformatics\/bti129","volume":"21","author":"S.H. Bokhari","year":"2005","unstructured":"Bokhari, S.H., Sauer, J.R.: A parallel graph decomposition algorithm for DNA sequencing with nanopores. Bioinformatics\u00a021(7), 889\u2013896 (2005)","journal-title":"Bioinformatics"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1101\/gr.7337908","volume":"18","author":"J. Butler","year":"2008","unstructured":"Butler, J., MacCallum, I., Kleber, M., Shlyakhter, I.A., Belmonte, M.K., Lander, E.S., Nusbaum, C., Jaffe, D.B.: ALLPATHS: De novo assembly of whole-genome shotgun microreads. Genome Res.\u00a018, 810\u2013820 (2008)","journal-title":"Genome Res."},{"issue":"13","key":"29_CR4","doi-asserted-by":"publisher","first-page":"2067","DOI":"10.1093\/bioinformatics\/bth205","volume":"20","author":"M. Chaisson","year":"2004","unstructured":"Chaisson, M., Pevzner, P., Tang, H.: Fragment assembly with short reads. Bioinformatics\u00a020(13), 2067\u20132074 (2004)","journal-title":"Bioinformatics"},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1101\/gr.7088808","volume":"18","author":"M.J. Chaisson","year":"2008","unstructured":"Chaisson, M.J., Pevzner, P.A.: Short read fragment assembly of bacterial genomes. Genome Res.\u00a018, 324\u2013330 (2008)","journal-title":"Genome Res."},{"key":"29_CR6","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Heidelberg (2005)","edition":"3"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1104\/pp.004051","volume":"129","author":"A.E. Hall","year":"2002","unstructured":"Hall, A.E., Fiebig, A., Preuss, D.: Beyond the arabidopsis genome: Opportunities for comparative genomics. Plant Physiol.\u00a0129, 1439\u20131447 (2002)","journal-title":"Plant Physiol."},{"key":"29_CR8","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-74126-8_21","volume-title":"Algorithms in Bioinformatics","author":"L.S. Heath","year":"2007","unstructured":"Heath, L.S., Pati, A.: Genomic signatures in de Bruijn chains. In: Giancarlo, R., Hannenhalli, S. (eds.) WABI 2007. LNCS (LNBI), vol.\u00a04645, pp. 216\u2013227. Springer, Heidelberg (2007)"},{"issue":"2","key":"29_CR9","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1089\/cmb.1995.2.291","volume":"2","author":"R.M. Idury","year":"1995","unstructured":"Idury, R.M., Waterman, M.S.: A new algorithm for DNA sequence assembly. J. Comput. Biol.\u00a02(2), 291\u2013306 (1995)","journal-title":"J. Comput. Biol."},{"issue":"3","key":"29_CR10","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1073\/pnas.77.3.1398","volume":"77","author":"W.R. Jelinek","year":"1980","unstructured":"Jelinek, W.R., Toomey, T.P., Leinwald, L., Duncan, C.H., Biro, P.A., Choudary, P.V., Weissman, S.M., Rubin, C.M., Houck, C.M., Deininger, P.L., Schmid, C.W.: Ubiquitous, interspersed repeated sequences in mammalian genomes. Proc. Natl. Acad. Sci. USA\u00a077(3), 1398\u20131402 (1980)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"3","key":"29_CR11","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1128\/MMBR.62.3.725-774.1998","volume":"62","author":"J. Mahillon","year":"1998","unstructured":"Mahillon, J., Chandler, M.: Insertion sequences. Microbiol. Mol. Biol. Rev.\u00a062(3), 725\u2013774 (1998)","journal-title":"Microbiol. Mol. Biol. Rev."},{"key":"29_CR12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1093\/bioinformatics\/bti1114","volume":"21","author":"E.W. Myers","year":"2005","unstructured":"Myers, E.W.: The fragment assembly string graphs. Bioinformatics\u00a021, ii79\u2013ii85 (2005)","journal-title":"Bioinformatics"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Pevzner, P.A., Tang, H., Tesler, G.: De novo repeat classification and fragment assembly. In: Proceedings of RECOMB 2004, pp. 213\u2013222 (March 2004)","DOI":"10.1145\/974614.974643"},{"issue":"17","key":"29_CR14","doi-asserted-by":"publisher","first-page":"9748","DOI":"10.1073\/pnas.171285098","volume":"98","author":"P.A. Pevzner","year":"2001","unstructured":"Pevzner, P.A., Tang, H., Waterman, M.S.: An Eulerian path approach to DNA fragment assembly. Proc. Natl. Acad. Sci. USA\u00a098(17), 9748\u20139753 (2001)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1038\/35038572","volume":"1","author":"E.T. Luning Prak","year":"2000","unstructured":"Luning Prak, E.T., Kazazian Jr., H.H.: Mobile elements and the human genome. Nature Rev.\u00a01, 134\u2013144 (2000)","journal-title":"Nature Rev."},{"key":"29_CR16","unstructured":"Amgarten Quitzau, J.A., Stoye, J.: A space efficient representation for sparse de Bruijn subgraphs. Report, Technische Fakult\u00e4t der Universit\u00e4t Bielefeld, Abteilung Informationstechnik (2008), \n                    http:\/\/bieson.ub.uni-bielefeld.de\/frontdoor.php?source_opus=1308"},{"key":"29_CR17","doi-asserted-by":"publisher","first-page":"2336","DOI":"10.1101\/gr.2657504","volume":"14","author":"B. Raphael","year":"2004","unstructured":"Raphael, B., Zhi, D., Tang, H., Pevzner, P.: A novel method for multiple alignment of sequences with repeated and shuffled elements. Genome Res.\u00a014, 2336\u20132346 (2004)","journal-title":"Genome Res."},{"key":"29_CR18","unstructured":"Setubal, J.C., Meidanis, J.: Introduction to Computational Molecular Biology. PWS Publishing (1997)"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1101\/gr.074492.107","volume":"18","author":"D.R. Zerbino","year":"2008","unstructured":"Zerbino, D.R., Birney, E.: Velvet: Algorithms for de novo short read assembly using de Bruijn graphs. Genome Res.\u00a018, 821\u2013829 (2008)","journal-title":"Genome Res."},{"issue":"5","key":"29_CR20","doi-asserted-by":"publisher","first-page":"1285","DOI":"10.1073\/pnas.0409240102","volume":"102","author":"Y. Zhang","year":"2005","unstructured":"Zhang, Y., Waterman, M.S.: An Eulerian path approach to local multiple alignment for DNA sequences. Proc. Natl. Acad. Sci. USA\u00a0102(5), 1285\u20131290 (2005)","journal-title":"Proc. Natl. Acad. Sci. USA"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87361-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:35:41Z","timestamp":1714620941000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87361-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540873600","9783540873617"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87361-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}