{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:53:34Z","timestamp":1743076414912,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030489656"},{"type":"electronic","value":"9783030489663"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-48966-3_2","type":"book-chapter","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T13:04:23Z","timestamp":1590671063000},"page":"17-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Family of Tree-Based Generators for Bubbles in Directed Graphs"],"prefix":"10.1007","author":[{"given":"Vicente","family":"Acu\u00f1a","sequence":"first","affiliation":[]},{"given":"Leandro","family":"Lima","sequence":"additional","affiliation":[]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Pep\u00e8 Sciarria","sequence":"additional","affiliation":[]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[]},{"given":"Blerina","family":"Sinaimeri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-68705-6_2","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"V Acu\u00f1a","year":"2017","unstructured":"Acu\u00f1a, V., et al.: On bubble generators in directed graphs. In: Bodlaender, H.L., Woeginger, G.J. (eds.) WG 2017. LNCS, vol. 10520, pp. 18\u201331. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68705-6_2. Announced at WG 2017"},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-018-21770-7","volume":"8","author":"C Benoit-Pilven","year":"2018","unstructured":"Benoit-Pilven, C., et al.: Complementarity of assembly-first and mapping-first approaches for alternative splicing annotation and differential analysis from RNAseq data. Sci. Rep. 8(1), 1\u201313 (2018)","journal-title":"Sci. Rep."},{"key":"2_CR3","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). https:\/\/doi.org\/10.1007\/978-3-642-34109-0_13"},{"key":"2_CR4","doi-asserted-by":"publisher","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."},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1137\/0222013","volume":"22","author":"J Cheriyan","year":"1993","unstructured":"Cheriyan, J., Kao, M.-Y., Thurimella, R.: Scan-first search and sparse certificates: an improved parallel algorithm for $$k$$-vertex connectivity. SIAM J. Comput. 22(1), 157\u2013174 (1993)","journal-title":"SIAM J. Comput."},{"key":"2_CR6","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1093\/bioinformatics\/bts635","volume":"29","author":"A Dobin","year":"2013","unstructured":"Dobin, A., et al.: STAR: ultrafast universal RNA-seq aligner. Bioinformatics 29(1), 15\u201321 (2013)","journal-title":"Bioinformatics"},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","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"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1016\/j.dam.2017.10.001","volume":"235","author":"RH Hammack","year":"2018","unstructured":"Hammack, R.H., Kainen, P.C.: Robust cycle bases do not exist for $${K}_{n, n}$$ if $$n \\ge 8$$. Discret. Appl. Math. 235, 206\u2013211 (2018)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","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."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/S1571-0653(04)00087-3","volume":"11","author":"PC Kainen","year":"2002","unstructured":"Kainen, P.C.: On robust cycle bases. Electron. Notes Discret. Math. 11, 430\u2013437 (2002). The Ninth Quadrennial International Conference on Graph Theory. Combinatorics, Algorithms and Applications","journal-title":"Electron. Notes Discret. Math."},{"issue":"4","key":"2_CR12","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cosrev.2009.08.001","volume":"3","author":"T Kavitha","year":"2009","unstructured":"Kavitha, T., et al.: 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_CR13","doi-asserted-by":"publisher","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":"12","key":"2_CR14","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1002\/andp.18471481202","volume":"148","author":"G Kirchhoff","year":"1847","unstructured":"Kirchhoff, G.: Ueber die aufl\u00f6sung der gleichungen, auf welche man bei der untersuchung der linearen vertheilung galvanischer str\u00f6me gef\u00fchrt wird. Ann. Phys. 148(12), 497\u2013508 (1847)","journal-title":"Ann. Phys."},{"issue":"10","key":"2_CR15","doi-asserted-by":"publisher","first-page":"2432","DOI":"10.1016\/j.dam.2008.06.047","volume":"157","author":"K Klemm","year":"2009","unstructured":"Klemm, K., Stadler, P.F.: A note on fundamental, non-fundamental, and robust cycle bases. Discret. Appl. Math. 157(10), 2432\u20132438 (2009). Networks in Computational Biology","journal-title":"Discret. Appl. Math."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/s13015-017-0091-2","volume":"12","author":"L Lima","year":"2017","unstructured":"Lima, L., et al.: Playing hide and seek with repeats in local and global de novo transcriptome assembly of short RNA-seq reads. Algorithms Mol. Biol. 12, 2 (2017)","journal-title":"Algorithms Mol. Biol."},{"key":"2_CR17","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. Fundamenta Mathematicae 28, 22\u201332 (1937)","journal-title":"Fundamenta Mathematicae"},{"issue":"6","key":"2_CR18","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ygeno.2010.03.001","volume":"95","author":"JR Miller","year":"2010","unstructured":"Miller, J.R., Koren, S., Sutton, G.: Assembly algorithms for next-generation sequencing data. Genomics 95(6), 315\u2013327 (2010)","journal-title":"Genomics"},{"key":"2_CR19","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). https:\/\/doi.org\/10.1007\/978-3-642-40453-5_26"},{"issue":"S\u20136","key":"2_CR20","doi-asserted-by":"publisher","first-page":"S5","DOI":"10.1186\/1471-2105-13-S6-S5","volume":"13","author":"G Sacomoto","year":"2012","unstructured":"Sacomoto, G., et al.: Kis Splice: de-novo calling alternative splicing events from RNA-seq data. BMC Bioinform. 13(S\u20136), S5 (2012). https:\/\/doi.org\/10.1186\/1471-2105-13-S6-S5","journal-title":"BMC Bioinform."},{"key":"2_CR21","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). https:\/\/doi.org\/10.1007\/978-3-642-40453-5_9"},{"issue":"8","key":"2_CR22","doi-asserted-by":"publisher","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":"4","key":"2_CR23","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/TCBB.2014.2385696","volume":"12","author":"W-K 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. Bioinform. 12(4), 770\u2013777 (2015)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"2","key":"2_CR24","doi-asserted-by":"publisher","first-page":"e11","DOI":"10.1093\/nar\/gku1187","volume":"43","author":"R Uricaru","year":"2015","unstructured":"Uricaru, R., et al.: Reference-free detection of isolated SNPs. Nucleic Acids Res. 43(2), e11 (2015)","journal-title":"Nucleic Acids Res."},{"issue":"5","key":"2_CR25","doi-asserted-by":"publisher","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"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48966-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:14:29Z","timestamp":1710256469000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48966-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030489656","9783030489663"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48966-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bordeaux","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2020.labri.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5,9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference had to be postponed due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}