{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T05:12:01Z","timestamp":1774069921554,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,4,9]],"date-time":"2014-04-09T00:00:00Z","timestamp":1397001600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1186\/1471-2105-15-99","type":"journal-article","created":{"date-parts":[[2014,4,9]],"date-time":"2014-04-09T03:02:36Z","timestamp":1397012556000},"source":"Crossref","is-referenced-by-count":34,"title":["Genome alignment with graph data structures: a comparison"],"prefix":"10.1186","volume":"15","author":[{"given":"Birte","family":"Kehr","sequence":"first","affiliation":[]},{"given":"Kathrin","family":"Trappe","sequence":"additional","affiliation":[]},{"given":"Manuel","family":"Holtgrewe","sequence":"additional","affiliation":[]},{"given":"Knut","family":"Reinert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,9]]},"reference":[{"issue":"6078","key":"6382_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1126\/science.1216830","volume":"336","author":"DR Zerbino","year":"2012","unstructured":"Zerbino DR, Paten B, Haussler D: Integrating genomes. Science. 2012, 336 (6078): 179-182. 10.1126\/science.1216830.","journal-title":"Science"},{"key":"6382_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","volume":"147","author":"TF Smith","year":"1981","unstructured":"Smith TF, Waterman MS: Identification of common molecular subsequences. J Mol Biol. 1981, 147: 195-197. 10.1016\/0022-2836(81)90087-5.","journal-title":"J Mol Biol"},{"key":"6382_CR3","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-1-61779-582-4_8","volume":"855","author":"CN Dewey","year":"2012","unstructured":"Dewey CN: Whole-genome alignment. Methods Mol Biol. 2012, 855: 237-257. 10.1007\/978-1-61779-582-4_8.","journal-title":"Methods Mol Biol"},{"issue":"19","key":"6382_CR4","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1093\/bioinformatics\/btp452","volume":"25","author":"C Kemena","year":"2009","unstructured":"Kemena C, Notredame C: Upcoming challenges for multiple sequence alignment methods in the high-throughput era. Bioinformatics. 2009, 25 (19): 2455-2465. 10.1093\/bioinformatics\/btp452.","journal-title":"Bioinformatics"},{"issue":"3","key":"6382_CR5","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1093\/molbev\/mss256","volume":"30","author":"BP Blackburne","year":"2012","unstructured":"Blackburne BP, Whelan S: Class of multiple sequence alignment algorithm affects genomic analysis. Mol Biol Evol. 2012, 30 (3): 642-653.","journal-title":"Mol Biol Evol"},{"issue":"2","key":"6382_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1038\/nrg1767","volume":"7","author":"L Feuk","year":"2006","unstructured":"Feuk L, Carson AR, Scherer SW: Structural variation in the human genome. Nat Rev Genet. 2006, 7 (2): 85-97.","journal-title":"Nat Rev Genet"},{"issue":"4","key":"6382_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/BF02603120","volume":"25","author":"DF Feng","year":"1987","unstructured":"Feng DF, Doolittle RF: Progressive sequence alignment as a prerequisite to correct phylogenetic trees. J Mol Evol. 1987, 25 (4): 351-360. 10.1007\/BF02603120.","journal-title":"J Mol Evol"},{"issue":"22","key":"6382_CR8","doi-asserted-by":"publisher","first-page":"4673","DOI":"10.1093\/nar\/22.22.4673","volume":"22","author":"JD Thompson","year":"1994","unstructured":"Thompson JD, Higgins DG, Gibson TJ: CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Res. 1994, 22 (22): 4673-4680. 10.1093\/nar\/22.22.4673.","journal-title":"Nucleic Acids Res"},{"key":"6382_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1006\/jmbi.2000.4042","volume":"302","author":"C Notredame","year":"2000","unstructured":"Notredame C, Higgins DG, Heringa J: T-Coffee: a novel method for fast and accurate multiple sequence alignment. J Mol Biol. 2000, 302: 205-217. 10.1006\/jmbi.2000.4042.","journal-title":"J Mol Biol"},{"issue":"14","key":"6382_CR10","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1093\/nar\/gkf436","volume":"30","author":"K Katoh","year":"2002","unstructured":"Katoh K, Misawa K, Kuma K, Miyata T: MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform. Nucleic Acids Res. 2002, 30 (14): 3059-3066. 10.1093\/nar\/gkf436.","journal-title":"Nucleic Acids Res"},{"issue":"4","key":"6382_CR11","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1101\/gr.926603","volume":"13","author":"M Brudno","year":"2003","unstructured":"Brudno M, Do CB, Cooper GM, Kim MF, Davydov E, Green ED, Sidow A, Batzoglou S, NISC Comparative Sequencing Program: LAGAN and Multi-LAGAN: efficient tools for large-scale multiple alignment of genomic DNA. Genome Res. 2003, 13 (4): 721-731. 10.1101\/gr.926603.","journal-title":"Genome Res"},{"issue":"5","key":"6382_CR12","doi-asserted-by":"publisher","first-page":"1792","DOI":"10.1093\/nar\/gkh340","volume":"32","author":"RC Edgar","year":"2004","unstructured":"Edgar RC: MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Res. 2004, 32 (5): 1792-1797. 10.1093\/nar\/gkh340.","journal-title":"Nucleic Acids Res"},{"issue":"2","key":"6382_CR13","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1101\/gr.2821705","volume":"15","author":"CB Do","year":"2005","unstructured":"Do CB, Mahabhashyam MSP, Brudno M, Batzoglou S: ProbCons: probabilistic consistency-based multiple sequence alignment. Genome Res. 2005, 15 (2): 330-340. 10.1101\/gr.2821705.","journal-title":"Genome Res"},{"issue":"30","key":"6382_CR14","doi-asserted-by":"publisher","first-page":"10557","DOI":"10.1073\/pnas.0409137102","volume":"102","author":"A L\u00f6ytynoja","year":"2005","unstructured":"L\u00f6ytynoja A, Goldman N: An algorithm for progressive multiple alignment of sequences with insertions. Proc Natl Acad Sci USA. 2005, 102 (30): 10557-10562. 10.1073\/pnas.0409137102.","journal-title":"Proc Natl Acad Sci USA"},{"issue":"16","key":"6382_CR15","doi-asserted-by":"publisher","first-page":"i187","DOI":"10.1093\/bioinformatics\/btn281","volume":"24","author":"T Rausch","year":"2008","unstructured":"Rausch T, Emde AK, Weese D, D\u00f6ring A, Notredame C, Reinert K: Segment-based multiple sequence alignment. Bioinformatics. 2008, 24 (16): i187-i192. 10.1093\/bioinformatics\/btn281.","journal-title":"Bioinformatics"},{"issue":"5","key":"6382_CR16","doi-asserted-by":"publisher","first-page":"e1000392","DOI":"10.1371\/journal.pcbi.1000392","volume":"5","author":"RK Bradley","year":"2009","unstructured":"Bradley RK, Roberts A, Smoot M, Juvekar S, Do J, Dewey C, Holmes I, Pachter L: Fast statistical alignment. PLoS Comput Biol. 2009, 5 (5): e1000392-10.1371\/journal.pcbi.1000392.","journal-title":"PLoS Comput Biol"},{"issue":"4","key":"6382_CR17","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1101\/gr.1933104","volume":"14","author":"M Blanchette","year":"2004","unstructured":"Blanchette M, Kent WJ, Riemer C, Elnitski L, Smit AFA, Roskin KM, Baertsch R, Rosenbloom K, Clawson H, Green ED, Haussler D, Miller W: Aligning multiple genomic sequences with the threaded blockset aligner. Genome Res. 2004, 14 (4): 708-715. 10.1101\/gr.1933104.","journal-title":"Genome Res"},{"issue":"7","key":"6382_CR18","doi-asserted-by":"publisher","first-page":"1394","DOI":"10.1101\/gr.2289704","volume":"14","author":"ACE Darling","year":"2004","unstructured":"Darling ACE, Mau B, Blattner FR, Perna NT: Mauve: multiple alignment of conserved genomic sequence with rearrangements. Genome Res. 2004, 14 (7): 1394-1403. 10.1101\/gr.2289704.","journal-title":"Genome Res"},{"issue":"11","key":"6382_CR19","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. 2004, 14 (11): 2336-2346. 10.1101\/gr.2657504.","journal-title":"Genome Res"},{"issue":"4","key":"6382_CR20","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1101\/gr.081778.108","volume":"19","author":"I Dubchak","year":"2009","unstructured":"Dubchak I, Poliakov A, Kislyuk A, Brudno M: Multiple whole-genome alignments without a reference organism. Genome Res. 2009, 19 (4): 682-689. 10.1101\/gr.081778.108.","journal-title":"Genome Res"},{"issue":"3","key":"6382_CR21","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1093\/bioinformatics\/btq665","volume":"27","author":"SV Angiuoli","year":"2011","unstructured":"Angiuoli SV, Salzberg SL: Mugsy: fast multiple alignment of closely related whole genomes. Bioinformatics. 2011, 27 (3): 334-342. 10.1093\/bioinformatics\/btq665.","journal-title":"Bioinformatics"},{"issue":"9","key":"6382_CR22","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1101\/gr.123356.111","volume":"21","author":"B Paten","year":"2011","unstructured":"Paten B, Earl D, Nguyen N, Diekhans M, Zerbino D, Haussler D: Cactus: algorithms for genome multiple sequence alignment. Genome Res. 2011, 21 (9): 1512-1528. 10.1101\/gr.123356.111.","journal-title":"Genome Res"},{"key":"6382_CR23","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-1-61779-582-4_15","volume":"855","author":"N El-Mabrouk","year":"2012","unstructured":"El-Mabrouk N, Sankoff D: Analysis of gene order evolution beyond single-copy genes. Methods Mol Biol. 2012, 855: 397-429. 10.1007\/978-1-61779-582-4_15.","journal-title":"Methods Mol Biol"},{"key":"6382_CR24","first-page":"251","volume-title":"Computing and Combinatorics, Volume 1276 of Lecture Notes in Computer Science","author":"D Sankoff","year":"1997","unstructured":"Sankoff D, Blanchette M: The median problem for breakpoints in comparative genomics. Computing and Combinatorics, Volume 1276 of Lecture Notes in Computer Science. Edited by: Jiang T, Lee D. 1997, Heidelberg: Springer Berlin, 251-263."},{"key":"6382_CR25","first-page":"391","volume-title":"Algorithms in Bioinformatics, Volume 7534 of Lecture Notes in Computer Science","author":"B Kehr","year":"2012","unstructured":"Kehr B, Reinert K, Darling AE: Hidden breakpoints in genome alignments. Algorithms in Bioinformatics, Volume 7534 of Lecture Notes in Computer Science. Edited by: Raphael B, Tang J. 2012, Berlin Heidelberg: Springer, 391-403."},{"key":"6382_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli S, Pevzner PA: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J ACM. 1999, 46: 1-27. 10.1145\/300515.300516.","journal-title":"J ACM"},{"issue":"16","key":"6382_CR27","doi-asserted-by":"publisher","first-page":"3340","DOI":"10.1093\/bioinformatics\/bti535","volume":"21","author":"S Yancopoulos","year":"2005","unstructured":"Yancopoulos S, Attie O, Friedberg R: Efficient sorting of genomic permutations by translocation, inversion and block interchange. Bioinformatics. 2005, 21 (16): 3340-3346. 10.1093\/bioinformatics\/bti535.","journal-title":"Bioinformatics"},{"key":"6382_CR28","first-page":"163","volume-title":"Algorithms in Bioinformatics, Volume 4175 of Lecture Notes in Computer Science","author":"A Bergeron","year":"2006","unstructured":"Bergeron A, Mixtacki J, Stoye J: A unifying view of genome rearrangements. Algorithms in Bioinformatics, Volume 4175 of Lecture Notes in Computer Science. Edited by: B\u00fccher P, Moret BM. 2006, Berlin Heidelberg: Springer, 163-173."},{"issue":"5","key":"6382_CR29","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1101\/gr.082784.108","volume":"19","author":"MA Alekseyev","year":"2009","unstructured":"Alekseyev MA, Pevzner PA: Breakpoint graphs and ancestral genome reconstructions. Genome Res. 2009, 19 (5): 943-957. 10.1101\/gr.082784.108.","journal-title":"Genome Res"},{"key":"6382_CR30","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366872","volume-title":"Genome rearrangements and sorting by reversals","author":"V Bafna","year":"1993","unstructured":"Bafna V, Pevzner PA: Genome rearrangements and sorting by reversals. 1993,"},{"key":"6382_CR31","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/3-540-58094-8_26","volume-title":"Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, CPM \u201994","author":"JD Kececioglu","year":"1994","unstructured":"Kececioglu JD, Sankoff D: Efficient bounds for oriented chromosome inversion distance. Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching, CPM \u201994. 1994, Berlin Heidelberg: Springer, 307-325."},{"key":"6382_CR32","first-page":"106","volume-title":"Proceedings of the 4th Symposium on Combinatorial Pattern Matching (CPM), Volume 684 of Lecture Notes in Computer Science","author":"J Kececioglu","year":"1993","unstructured":"Kececioglu J: The maximum weight trace problem in multiple sequence alignment. Proceedings of the 4th Symposium on Combinatorial Pattern Matching (CPM), Volume 684 of Lecture Notes in Computer Science. 1993, Berlin Heidelberg: Springer, 106-119."},{"key":"6382_CR33","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1145\/267521.267845","volume-title":"Proceedings of the first annual international conference on Computational molecular biology","author":"K Reinert","year":"1997","unstructured":"Reinert K, Lenhof HP, Mutzel P, Mehlhorn K, Kececioglu JD: A branch-and-cut algorithm for multiple sequence alignment. Proceedings of the first annual international conference on Computational molecular biology. 1997, RECOMB \u201997, New York, NY, USA: ACM, 241-250."},{"issue":"6","key":"6382_CR34","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1093\/bioinformatics\/btr008","volume":"27","author":"J Fostier","year":"2011","unstructured":"Fostier J, Proost S, Dhoedt B, Saeys Y, Demeester P, de Peer YV, Vandepoele K: A greedy, graph-based algorithm for the alignment of multiple homologous gene lists. Bioinformatics. 2011, 27 (6): 749-756. 10.1093\/bioinformatics\/btr008.","journal-title":"Bioinformatics"},{"issue":"9","key":"6382_CR35","doi-asserted-by":"publisher","first-page":"1786","DOI":"10.1101\/gr.2395204","volume":"14","author":"PA Pevzner","year":"2004","unstructured":"Pevzner PA, Tang H, Tesler G: De novo repeat classification and fragment assembly. Genome Res. 2004, 14 (9): 1786-1796. 10.1101\/gr.2395204.","journal-title":"Genome Res"},{"key":"6382_CR36","first-page":"758","volume":"49","author":"NG de Bruijn","year":"1946","unstructured":"de Bruijn NG: A combinatorial problem. Proc Nederl Akad Wetensch. 1946, 49: 758-764.","journal-title":"Proc Nederl Akad Wetensch"},{"issue":"11","key":"6382_CR37","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1038\/nbt.2023","volume":"29","author":"PEC Compeau","year":"2011","unstructured":"Compeau PEC, Pevzner PA, Tesler G: How to apply de Bruijn graphs to genome assembly. Nat Biotechnol. 2011, 29 (11): 987-991. 10.1038\/nbt.2023.","journal-title":"Nat Biotechnol"},{"issue":"20","key":"6382_CR38","doi-asserted-by":"publisher","first-page":"2509","DOI":"10.1093\/bioinformatics\/btq465","volume":"26","author":"SK Pham","year":"2010","unstructured":"Pham SK, Pevzner PA: DRIMM-Synteny: decomposing genomes into evolutionary conserved segments. Bioinformatics. 2010, 26 (20): 2509-2516. 10.1093\/bioinformatics\/btq465.","journal-title":"Bioinformatics"},{"issue":"11","key":"6382_CR39","doi-asserted-by":"publisher","first-page":"1814","DOI":"10.1101\/gr.076554.108","volume":"18","author":"B Paten","year":"2008","unstructured":"Paten B, Herrero J, Beal K, Fitzgerald S, Birney E: Enredo and Pecan: genome-wide mammalian consistency-based multiple alignment with paralogs. Genome Res. 2008, 18 (11): 1814-1828. 10.1101\/gr.076554.108.","journal-title":"Genome Res"},{"issue":"3","key":"6382_CR40","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1089\/cmb.2010.0252","volume":"18","author":"B Paten","year":"2011","unstructured":"Paten B, Diekhans M, Earl D, John JS, Ma J, Suh B, Haussler D: Cactus graphs for genome comparisons. J Comput Biol. 2011, 18 (3): 469-481. 10.1089\/cmb.2010.0252.","journal-title":"J Comput Biol"},{"issue":"4","key":"6382_CR41","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1073\/pnas.39.4.315","volume":"39","author":"F Harary","year":"1953","unstructured":"Harary F, Uhlenbeck GE: On the number of husimi trees: I. Proc Natl Acad Sci USA. 1953, 39 (4): 315-322. 10.1073\/pnas.39.4.315.","journal-title":"Proc Natl Acad Sci USA"},{"issue":"5","key":"6382_CR42","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1089\/cmb.2010.0101","volume":"18","author":"NA Belal","year":"2011","unstructured":"Belal NA, Heath LS: A theoretical model for whole genome alignment. J Comput Biol. 2011, 18 (5): 705-728. 10.1089\/cmb.2010.0101.","journal-title":"J Comput Biol"},{"key":"6382_CR43","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Stein C, Rivest RL, Leiserson CE: Introduction to Algorithms. 2001, Cambridge, MA, USA: The MIT Press"},{"issue":"3","key":"6382_CR44","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1093\/bioinformatics\/18.3.452","volume":"18","author":"C Lee","year":"2002","unstructured":"Lee C, Grasso C, Sharlow MF: Multiple sequence alignment using partial order graphs. Bioinformatics. 2002, 18 (3): 452-464. 10.1093\/bioinformatics\/18.3.452.","journal-title":"Bioinformatics"},{"issue":"6","key":"6382_CR45","doi-asserted-by":"publisher","first-page":"e11147","DOI":"10.1371\/journal.pone.0011147","volume":"5","author":"AE Darling","year":"2010","unstructured":"Darling AE, Mau B, Perna NT: progressiveMauve: multiple genome alignment with gene gain, loss and rearrangement. PLoS One. 2010, 5 (6): e11147-10.1371\/journal.pone.0011147.","journal-title":"PLoS One"},{"key":"6382_CR46","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-45784-4_10","volume-title":"Proceedings of the Second International Workshop on Algorithms in Bioinformatics, WABI \u201902","author":"AL Halpern","year":"2002","unstructured":"Halpern AL, Huson DH, Reinert K: Segment match refinement and applications. Proceedings of the Second International Workshop on Algorithms in Bioinformatics, WABI \u201902. 2002, Berlin Heidelberg: Springer, 126-139."},{"key":"6382_CR47","doi-asserted-by":"publisher","first-page":"S312","DOI":"10.1093\/bioinformatics\/18.suppl_1.S312","volume":"18 Suppl 1","author":"M H\u00f6hl","year":"2002","unstructured":"H\u00f6hl M, Kurtz S, Ohlebusch E: Efficient multiple genome alignment. Bioinformatics. 2002, 18 Suppl 1: S312-S320.","journal-title":"Bioinformatics"},{"issue":"4","key":"6382_CR48","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1006\/jmbi.1996.0679","volume":"264","author":"O Gotoh","year":"1996","unstructured":"Gotoh O: Significant improvement in accuracy of multiple protein sequence alignments by iterative refinement as assessed by reference to structural alignments. J Mol Biol. 1996, 264 (4): 823-838. 10.1006\/jmbi.1996.0679.","journal-title":"J Mol Biol"},{"issue":"5","key":"6382_CR49","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1093\/bib\/bbr040","volume":"12","author":"CN Dewey","year":"2011","unstructured":"Dewey CN: Positional orthology: putting genomic evolutionary relationships into context. Brief Bioinform. 2011, 12 (5): 401-412. 10.1093\/bib\/bbr040.","journal-title":"Brief Bioinform"},{"key":"6382_CR50","unstructured":"Hickey G, Paten B: Progressive Cactus. [ https:\/\/github.com\/glennhickey\/progressiveCactus ],"},{"key":"6382_CR51","first-page":"215","volume-title":"Algorithms in Bioinformatics, Volume 8126 of Lecture Notes in Computer Science","author":"I Minkin","year":"2013","unstructured":"Minkin I, Patel A, Kolmogorov M, Vyahhi N, Pham S: Sibelia: a scalable and comprehensive synteny block generation tool for closely related microbial genomes. Algorithms in Bioinformatics, Volume 8126 of Lecture Notes in Computer Science. Edited by: Darling A, Stoye J. 2013, Berlin Heidelberg: Springer, 215-229."}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-15-99.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1471-2105-15-99\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-15-99.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T23:40:32Z","timestamp":1689118832000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-15-99"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,9]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["6382"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-15-99","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,9]]},"article-number":"99"}}