{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T20:44:26Z","timestamp":1725914666157},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319687049"},{"type":"electronic","value":"9783319687056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68705-6_2","type":"book-chapter","created":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T06:06:22Z","timestamp":1509516382000},"page":"18-31","source":"Crossref","is-referenced-by-count":4,"title":["On Bubble Generators in Directed Graphs"],"prefix":"10.1007","author":[{"given":"Vicente","family":"Acu\u00f1a","sequence":"first","affiliation":[]},{"given":"Roberto","family":"Grossi","sequence":"additional","affiliation":[]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[]},{"given":"Leandro","family":"Lima","sequence":"additional","affiliation":[]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[]},{"given":"Gustavo","family":"Sacomoto","sequence":"additional","affiliation":[]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[]},{"given":"Blerina","family":"Sinaimeri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,2]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-642-34109-0_13","volume-title":"String Processing and Information Retrieval","author":"E Birmel\u00e9","year":"2012","unstructured":"Birmel\u00e9, E., et al.: Efficient bubble enumeration in directed graphs. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 118\u2013129. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-34109-0_13"},{"key":"2_CR2","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Graduate Texts in Mathematics, vol. 184. Springer-Verlag, Berlin (1998). doi: 10.1007\/978-1-4612-0619-4"},{"key":"2_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Elsevier, New York (1976)"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/j.tcs.2015.10.021","volume":"609","author":"L Brankovic","year":"2016","unstructured":"Brankovic, L., Iliopoulos, C.S., Kundu, R., Mohamed, M., Pissis, S.P., Vayani, F.: Linear-time superbubble identification algorithm for genome assembly. Theoret. Comput. Sci. 609, 374\u2013383 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR5","series-title":"Prentice-Hall series in Automatic Computation","volume-title":"Graph Theory with Applications to Engineering and Computer Science","author":"N Deo","year":"1974","unstructured":"Deo, N.: Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall series in Automatic Computation. Prentice-Hall, Englewood Cliffs (1974)"},{"issue":"2","key":"2_CR6","doi-asserted-by":"crossref","first-page":"241","DOI":"10.7151\/dmgt.1200","volume":"23","author":"PM Gleiss","year":"2003","unstructured":"Gleiss, P.M., Leydold, J., Stadler, P.F.: Circuit bases of strongly connected digraphs. Discuss. Math. Graph Theory 23(2), 241\u2013260 (2003)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"2","key":"2_CR7","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1038\/ng.1028","volume":"44","author":"Z Iqbal","year":"2012","unstructured":"Iqbal, Z., Caccamo, M., Turner, I., Flicek, P., McVean, G.: De novo assembly and genotyping of variants using colored de bruijn graphs. Nat. Genet. 44(2), 226\u2013232 (2012)","journal-title":"Nat. Genet."},{"issue":"4","key":"2_CR8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.cosrev.2009.08.001","volume":"3","author":"T Kavitha","year":"2009","unstructured":"Kavitha, T., Liebchen, C., Mehlhorn, K., Michail, D., Rizzi, R., Ueckerdt, T., Zweig, K.A.: Cycle bases in graphs characterization, algorithms, complexity, and applications. Comput. Sci. Rev. 3(4), 199\u2013243 (2009)","journal-title":"Comput. Sci. Rev."},{"issue":"4","key":"2_CR9","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s00224-006-1319-6","volume":"40","author":"T Kavitha","year":"2007","unstructured":"Kavitha, T., Mehlhorn, K.: Algorithms to compute minimum cycle bases in directed graphs. Theory Comput. Syst. 40(4), 485\u2013505 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"14","key":"2_CR10","doi-asserted-by":"crossref","first-page":"1838","DOI":"10.1093\/bioinformatics\/bts280","volume":"28","author":"H Li","year":"2012","unstructured":"Li, H.: Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly. Bioinformatics 28(14), 1838\u20131844 (2012)","journal-title":"Bioinformatics"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1186\/s13015-017-0091-2","volume":"12","author":"L Lima","year":"2017","unstructured":"Lima, L., Sinaimeri, B., Sacomoto, G., Lopez-Maestre, H., Marchet, C., Miele, V., Sagot, M.F., Lacroix, V.: Playing hide and seek with repeats in local and global de novo transcriptome assembly of short RNA-seq reads. Algorithms Mol. Biol. 12(1), 2:1\u20132:19 (2017). doi: 10.1186\/s13015-017-0091-2","journal-title":"Algorithms Mol. Biol."},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"22","DOI":"10.4064\/fm-28-1-22-32","volume":"28","author":"S MacLane","year":"1937","unstructured":"MacLane, S.: A combinatorial condition for planar graphs. Fundam. Math. 28, 22\u201332 (1937)","journal-title":"Fundam. Math."},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-40453-5_26","volume-title":"Algorithms in Bioinformatics","author":"T Onodera","year":"2013","unstructured":"Onodera, T., Sadakane, K., Shibuya, T.: Detecting superbubbles in assembly graphs. In: Darling, A., Stoye, J. (eds.) WABI 2013. LNCS, vol. 8126, pp. 338\u2013348. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40453-5_26"},{"issue":"9","key":"2_CR14","doi-asserted-by":"crossref","first-page":"1786","DOI":"10.1101\/gr.2395204","volume":"14","author":"PA Pevzner","year":"2004","unstructured":"Pevzner, P.A., Tang, H., Tesler, G.: De novo repeat classification and fragment assembly. Genome Res. 14(9), 1786\u20131796 (2004)","journal-title":"Genome Res."},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-642-40453-5_9","volume-title":"Algorithms in Bioinformatics","author":"G Sacomoto","year":"2013","unstructured":"Sacomoto, G., Lacroix, V., Sagot, M.-F.: A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs and its application to the detection of alternative splicing in RNA-seq data. In: Darling, A., Stoye, J. (eds.) WABI 2013. LNCS, vol. 8126, pp. 99\u2013111. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40453-5_9"},{"issue":"S\u20136","key":"2_CR16","doi-asserted-by":"crossref","first-page":"S5","DOI":"10.1186\/1471-2105-13-S6-S5","volume":"13","author":"G Sacomoto","year":"2012","unstructured":"Sacomoto, G., Kielbassa, J., Chikhi, R., Uricaru, R., Antoniou, P., Sagot, M.F., Peterlongo, P., Lacroix, V.: KISSPLICE: de-novo calling alternative splicing events from RNA-seq data. BMC Bioinf. 13(S\u20136), S5 (2012)","journal-title":"BMC Bioinf."},{"issue":"8","key":"2_CR17","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1089\/cmb.2009.0108","volume":"16","author":"M Sammeth","year":"2009","unstructured":"Sammeth, M.: Complete alternative splicing events are bubbles in splicing graphs. J. Comput. Biol. 16(8), 1117\u20131140 (2009)","journal-title":"J. Comput. Biol."},{"issue":"6","key":"2_CR18","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1101\/gr.089532.108","volume":"19","author":"JT Simpson","year":"2009","unstructured":"Simpson, J.T., Wong, K., Jackman, S.D., Schein, J.E., Jones, S.J.M., Birol, I.: ABySS: a parallel assembler for short read sequence data. Genome Res. 19(6), 1117\u20131123 (2009)","journal-title":"Genome Res."},{"issue":"4","key":"2_CR19","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1109\/TCBB.2014.2385696","volume":"12","author":"WK Sung","year":"2015","unstructured":"Sung, W.K., Sadakane, K., Shibuya, T., Belorkar, A., Pyrogova, I.: An o(m log m)-time algorithm for detecting superbubbles. IEEE\/ACM Trans. Comput. Biol. Bioinf. 12(4), 770\u2013777 (2015)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"2","key":"2_CR20","doi-asserted-by":"crossref","first-page":"e11","DOI":"10.1093\/nar\/gku1187","volume":"43","author":"R Uricaru","year":"2015","unstructured":"Uricaru, R., Rizk, G., Lacroix, V., Quillery, E., Plantard, O., Chikhi, R., Lemaitre, C., Peterlongo, P.: Reference-free detection of isolated SNPs. Nucleic Acids Res. 43(2), e11 (2015)","journal-title":"Nucleic Acids Res."},{"issue":"5","key":"2_CR21","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1093\/bioinformatics\/btu706","volume":"31","author":"R Younsi","year":"2015","unstructured":"Younsi, R., MacLean, D.: Using 2k+2 bubble searches to find single nucleotide polymorphisms in k-mer graphs. Bioinformatics 31(5), 642\u2013646 (2015)","journal-title":"Bioinformatics"},{"key":"2_CR22","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1101\/gr.074492.107","volume":"18","author":"D Zerbino","year":"2008","unstructured":"Zerbino, D., Birney, E.: Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res. 18, 821\u2013829 (2008)","journal-title":"Genome Res."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68705-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,6]],"date-time":"2022-08-06T01:10:05Z","timestamp":1659748205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68705-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687049","9783319687056"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68705-6_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}