{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T07:24:07Z","timestamp":1648970647918},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1186\/s13015-015-0046-4","type":"journal-article","created":{"date-parts":[[2015,6,26]],"date-time":"2015-06-26T13:46:58Z","timestamp":1435326418000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A polynomial delay algorithm for the enumeration of bubbles with length constraints in directed graphs"],"prefix":"10.1186","volume":"10","author":[{"given":"Gustavo","family":"Sacomoto","sequence":"first","affiliation":[]},{"given":"Vincent","family":"Lacroix","sequence":"additional","affiliation":[]},{"given":"Marie-France","family":"Sagot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,27]]},"reference":[{"issue":"7221","key":"46_CR1","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1038\/nature07509","volume":"456","author":"E Wang","year":"2008","unstructured":"Wang E, Sandberg R, Luo S, Khrebtukova I, Zhang L, Mayr C et al (2008) Alternative isoform regulation in human tissue transcriptomes. Nature 456(7221):470\u2013476","journal-title":"Nature"},{"key":"46_CR2","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1038\/nmeth.1226","volume":"5","author":"A Mortazavi","year":"2008","unstructured":"Mortazavi A, Williams B, McCue K, Schaeffer L, Wold B (2008) Mapping and quantifying mammalian transcriptomes by RNA-seq. Nat Methods 5:621\u2013628","journal-title":"Nat Methods"},{"key":"46_CR3","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1038\/nbt.1883","volume":"29","author":"MG Grabherr","year":"2011","unstructured":"Grabherr MG, Haas BJ, Yassour M, Levin JZ, Thompson DA, Amit I et al (2011) D.A.T.: full-length transcriptome assembly from RNA-seq data without a reference genome. Nat Biotechnol 29:644\u2013652","journal-title":"Nat Biotechnol"},{"key":"46_CR4","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1038\/nmeth.1517","volume":"7","author":"G Robertson","year":"2010","unstructured":"Robertson G, Schein J, Chiu R et al (2010) R.C.: de novo assembly and analysis of RNA-seq data. Nat Methods 7:909\u2013912","journal-title":"Nat Methods"},{"key":"46_CR5","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1093\/bioinformatics\/bts094","volume":"28","author":"MH Schulz","year":"2012","unstructured":"Schulz MH, Zerbino DR, Vingron M, Birney E (2012) Oases: robust de novo RNA-seq assembly across the dynamic range of expression levels. Bioinformatics 28:1086\u20131092","journal-title":"Bioinformatics"},{"key":"46_CR6","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1186\/1471-2105-13-5","volume":"13","author":"GAT Sacomoto","year":"2012","unstructured":"Sacomoto GAT, Kielbassa J, Chikhi R, Uricaru R, Antoniou P, Sagot M-F et al (2012) Kissplice: de-novo calling alternative splicing events from RNA-seq data. BMC Bioinform 13:5","journal-title":"BMC Bioinformatics"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Birmel\u00e9 E, Crescenzi P, Ferreira RA, Grossi R, Lacroix V, Marino A et al (2012) Efficient bubble enumeration in directed graphs. In: Calder\u00f3n-Benavides L, Gonz\u00e1lez-Caro C, Ch\u00e1vez E, Ziviani N (eds) String Processing and Information Retrieval, Lecture Notes in Computer Science, vol 7608. Springer, Heidelberg, pp 118\u2013129","DOI":"10.1007\/978-3-642-34109-0_13"},{"key":"46_CR8","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. The MIT Press, Cambridge"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"Chikhi R, Rizk G (2012) Space-efficient and exact de Bruijn graph representation based on a Bloom filter. In: Raphael B, Tang J (eds) Algorithms in Bioinformatics. WABI, Lecture Notes in Computer Science, vol 7534. Springer, Heidelberg, pp 236\u2013248","DOI":"10.1007\/978-3-642-33122-0_19"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Salikhov K, Sacomoto G, Kucherov G (2013) Using cascading bloom filters to improve the memory usage for de Brujin graphs. In: Darling A, Stoye J (eds) Algorithms in Bioinformatics. WABI, Lecture notes in computer science, vol 8126. Springer, Heidelberg, pp 364\u2013376","DOI":"10.1007\/978-3-642-40453-5_28"},{"key":"46_CR11","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/77600.77615","volume":"37","author":"RK Ahuja","year":"1990","unstructured":"Ahuja RK, Mehlhorn K, Orlin JB, Tarjan RE (1990) Faster algorithms for the shortest path problem. J ACM 37:213\u2013223","journal-title":"J ACM"},{"key":"46_CR12","unstructured":"Chen M, Chowdhury RA, Ramachandran V, Roche DL, Tong L (2007) Priority queues and Dijkstra\u2019s algorithm. Technical Report TR-07-54, University of Texas, Austin"},{"issue":"Database issue","key":"46_CR13","doi-asserted-by":"crossref","first-page":"D749","DOI":"10.1093\/nar\/gkt1196","volume":"42","author":"P Flicek","year":"2014","unstructured":"Flicek P, Amode MR, Barrell D, Beal K, Billis K, Brent S et al (2014) Ensembl 2014. Nucleic Acids Res 42(Database issue):D749\u2013D755. doi: 10.1093\/nar\/gkt1196","journal-title":"Nucleic Acids Res"},{"issue":"1","key":"46_CR14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1093\/bioinformatics\/bts635","volume":"29","author":"A Dobin","year":"2013","unstructured":"Dobin A, Davis C, Schlesinger F, Drenkow J, Zaleski C, Jhai S et al (2013) Star: ultrafast universal RNA-seq aligner. Bioinformatics 29(1):15\u201321","journal-title":"Bioinformatics"},{"key":"46_CR15","doi-asserted-by":"crossref","unstructured":"Li C-L, McCormick ST, Simchi-Levi D (1990) The complexity of finding two disjoint paths with min\u2013max objective function. Disc Appl Math","DOI":"10.1016\/0166-218X(90)90024-7"},{"issue":"2","key":"46_CR16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0925-7721(98)00021-2","volume":"11","author":"MR Bussieck","year":"1998","unstructured":"Bussieck MR, L\u00fcbbecke ME (1998) The vertex set of a 0\/1-polytope is strongly p-enumerable. Comput Geom 11(2):103\u2013109","journal-title":"Comput Geom"},{"key":"46_CR17","unstructured":"KisSplice (2013). http:\/\/kissplice.prabi.fr\/"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-015-0046-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T19:05:33Z","timestamp":1566932733000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.almob.org\/content\/10\/1\/20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,27]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["46"],"URL":"https:\/\/doi.org\/10.1186\/s13015-015-0046-4","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,27]]},"article-number":"20"}}