{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T06:40:08Z","timestamp":1752043208635,"version":"3.41.2"},"reference-count":81,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,9,24]],"date-time":"2018-09-24T00:00:00Z","timestamp":1537747200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["01IS14014B"],"award-info":[{"award-number":["01IS14014B"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1186\/s13015-018-0133-4","type":"journal-article","created":{"date-parts":[[2018,9,24]],"date-time":"2018-09-24T04:26:53Z","timestamp":1537763213000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Coordinate systems for supergenomes"],"prefix":"10.1186","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1128-3408","authenticated-orcid":false,"given":"Fabian","family":"G\u00e4rtner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"H\u00f6ner zu Siederdissen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lydia","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter F.","family":"Stadler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,24]]},"reference":[{"issue":"3","key":"133_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1038\/nrg.2015.16","volume":"17","author":"C Gawad","year":"2016","unstructured":"Gawad C, Koh W, Quake SR. Single-cell genome sequencing: current state of the science. Nat Rev Genet. 2016;17(3):175\u201388.","journal-title":"Nat Rev Genet"},{"issue":"7571","key":"133_CR2","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1038\/nature15393","volume":"526","author":"Genomes Project Consortium","year":"2015","unstructured":"Genomes Project Consortium. A global reference for human genetic variation. Nature. 2015;526(7571):68\u201374.","journal-title":"Nature"},{"key":"133_CR3","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1016\/j.celrep.2015.04.023","volume":"11","author":"H Hezroni","year":"2015","unstructured":"Hezroni H, Koppstein D, Schwartz MG, Avrutin A, Bartel DP, Ulitsky I. Principles of long noncoding RNA evolution derived from direct comparison of transcriptomes in 17 species. Cell Rep. 2015;11:1110\u201322. https:\/\/doi.org\/10.1016\/j.celrep.2015.04.023 .","journal-title":"Cell Rep"},{"key":"133_CR4","doi-asserted-by":"publisher","first-page":"17224","DOI":"10.1073\/pnas.1413624111","volume":"111","author":"S Lin","year":"2014","unstructured":"Lin S, Lin Y, Nery JR, Urich MA, Breschi A, Davis CA, Dobin A, Zaleski C, Beer MA, Chapman WC, Gingeras TR, Ecker JR, Snyder MP. Comparison of the transcriptional landscapes between human and mouse tissues. Proc Natl Acad Sci USA. 2014;111:17224\u20139. https:\/\/doi.org\/10.1073\/pnas.1413624111 .","journal-title":"Proc Natl Acad Sci USA"},{"key":"133_CR5","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1038\/nrg3802","volume":"15","author":"A Necsulea","year":"2014","unstructured":"Necsulea A, Kaessmann H. Evolutionary dynamics of coding and non-coding transcriptomes. Nat Rev Genet. 2014;15:734\u201348. https:\/\/doi.org\/10.1038\/nrg3802 .","journal-title":"Nat Rev Genet"},{"key":"133_CR6","doi-asserted-by":"publisher","first-page":"e09977","DOI":"10.7554\/eLife.09977","volume":"5","author":"R Neme","year":"2016","unstructured":"Neme R, Tautz D. Fast turnover of genome transcription across evolutionary time exposes entire non-coding DNA to de novo gene emergence. Elife. 2016;5:e09977.","journal-title":"Elife"},{"key":"133_CR7","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1101\/gr.165035.113","volume":"24","author":"S Washietl","year":"2014","unstructured":"Washietl S, Kellis M, Garber M. Evolutionary dynamics and tissue specificity of human long noncodingRNAs in six mammals. Genome Res. 2014;24:616\u201328.","journal-title":"Genome Res"},{"issue":"23","key":"133_CR8","doi-asserted-by":"publisher","first-page":"3293","DOI":"10.1093\/bioinformatics\/btu534","volume":"30","author":"N Nguyen","year":"2014","unstructured":"Nguyen N, Hickey G, Raney BJ, Armstrong J, Clawson H, Zweig A, Karolchik D, Kent WJ, Haussler D, Paten B. Comparative assembly hubs: web-accessible browsers for comparative genomics. Bioinformatics. 2014;30(23):3293\u2013301.","journal-title":"Bioinformatics"},{"issue":"6","key":"133_CR9","doi-asserted-by":"publisher","first-page":"11147","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):11147.","journal-title":"PloS ONE"},{"issue":"1","key":"133_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1101\/gr.809403","volume":"13","author":"S Schwartz","year":"2003","unstructured":"Schwartz S, Kent WJ, Smit A, Zhang Z, Baertsch R, Hardison RC, Haussler D, Miller W. Human-mouse alignments with blastz. Genome Res. 2003;13(1):103\u20137.","journal-title":"Genome Res"},{"issue":"4","key":"133_CR11","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 AF, Roskin KM, Baertsch R, Rosenbloom K, Clawson H, Green ED. Aligning multiple genomic sequences with the threaded blockse aligner. Genome Res. 2004;14(4):708\u201315.","journal-title":"Genome Res"},{"key":"133_CR12","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:1814\u201328.","journal-title":"Genome Res"},{"key":"133_CR13","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1101\/gr.1960404","volume":"14","author":"N Bray","year":"2004","unstructured":"Bray N, Pachter L. MAVID: constrained ancestral alignment of multiple sequences. Genome Res. 2004;14:693\u20139. https:\/\/doi.org\/10.1101\/gr.1960404 .","journal-title":"Genome Res"},{"key":"133_CR14","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1038\/nbt.1637","volume":"28","author":"X Chen","year":"2010","unstructured":"Chen X, Tompa M. Comparative assessment of methods for aligning multiple genome sequences. Nat Biotech. 2010;28:567\u201372. https:\/\/doi.org\/10.1038\/nbt.1637 .","journal-title":"Nat Biotech"},{"key":"133_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1002\/wsbm.1274","volume":"6","author":"S Xiao","year":"2014","unstructured":"Xiao S, Cao X, Zhong S. Comparative epigenomics: defining and utilizing epigenomic variations across species, time-course, and individuals. Wiley Interdiscip Rev Syst Biol Med. 2014;6:345\u201352. https:\/\/doi.org\/10.1002\/wsbm.1274 .","journal-title":"Wiley Interdiscip Rev Syst Biol Med"},{"key":"133_CR16","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1261\/rna.046342.114","volume":"21","author":"A Nitsche","year":"2015","unstructured":"Nitsche A, Rose D, Fasold M, Reiche K, Stadler PF. Comparison of splice sites reveals that long non-coding RNAs are evolutionarily well conserved. RNA. 2015;21:801\u201312. https:\/\/doi.org\/10.1261\/rna.046342.114 .","journal-title":"RNA"},{"key":"133_CR17","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1093\/bioinformatics\/bts217","volume":"28","author":"A Herbig","year":"2012","unstructured":"Herbig A, J\u00e4ger G, Battke F, Nieselt K. GenomeRing: alignment visualization based on SuperGenome coordinates. Bioinformatics. 2012;28:7\u201315.","journal-title":"Bioinformatics"},{"key":"133_CR18","doi-asserted-by":"publisher","first-page":"1003495","DOI":"10.1371\/journal.pgen.1003495","volume":"9","author":"G Dugar","year":"2013","unstructured":"Dugar G, Herbig A, F\u00f6rstner KU, Heidrich N, Reinhardt R, Nieselt K, Sharma CM. High-resolution transcriptome maps reveal strain-specific regulatory features of multiple Campylobacter jejuni isolates. PLoS Genet. 2013;9:1003495. https:\/\/doi.org\/10.1371\/journal.pgen.1003495 .","journal-title":"PLoS Genet"},{"key":"133_CR19","doi-asserted-by":"publisher","first-page":"1522","DOI":"10.1134\/S0006297915110152","volume":"80","author":"DV Goryunov","year":"2015","unstructured":"Goryunov DV, Nagaev BE, Nikolaev MY, Alexeevski AV, Troitsky AV. Moss phylogeny reconstruction using nucleotide pangenome of complete mitogenome sequences. Biochemistry (Mosc). 2015;80:1522\u20137. https:\/\/doi.org\/10.1134\/S0006297915110152 .","journal-title":"Biochemistry (Mosc)"},{"key":"133_CR20","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/j.gde.2005.09.006","volume":"15","author":"D Medini","year":"2005","unstructured":"Medini D, Donati C, Tettelin H, Masignani V, Rappuoli R. The microbial pan-genome. Curr Op Genet Dev. 2005;15:589\u201394. https:\/\/doi.org\/10.1016\/j.gde.2005.09.006 .","journal-title":"Curr Op Genet Devel"},{"key":"133_CR21","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/s00224-011-9312-0","volume":"50","author":"HL Bodlaender","year":"2012","unstructured":"Bodlaender HL, Fomin FV, Koster AMCA, Kratsch D, Thilikos DM. A note on exact algorithms for vertex ordering problems on graphs. Theory Comput Syst. 2012;50:420\u201332.","journal-title":"Theory Comput Syst"},{"issue":"1","key":"133_CR22","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/TC.2013.205","volume":"64","author":"K Li","year":"2015","unstructured":"Li K, Tang X, Veeravalli B, Li K. Scheduling precedence constrained stochastic tasks on heterogeneous cluster systems. IEEE Trans Comput. 2015;64(1):191\u2013204.","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"133_CR23","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2898352","volume":"8","author":"MR Fellows","year":"2016","unstructured":"Fellows MR, Hermelin D, Rosamond F, Shachnai H. Tractable parameterizations for the minimum linear arrangement problem. ACM Trans Comput Theory. 2016;8(2):6.","journal-title":"ACM Trans Comput Theory"},{"key":"133_CR24","first-page":"1","volume-title":"Linear layout problems","author":"EG Pardo","year":"2016","unstructured":"Pardo EG, Mart\u00ed R, Duarte A. Linear layout problems. Berlin: Springer; 2016. p. 1\u201325."},{"key":"133_CR25","series-title":"Combinatorial pattern matching","first-page":"106","volume-title":"The maximum weight trace problem in multiple sequence alignment","author":"J Kececioglu","year":"1993","unstructured":"Kececioglu J. The maximum weight trace problem in multiple sequence alignment. Combinatorial pattern matching. Berlin: Springer; 1993. p. 106\u201319."},{"issue":"9","key":"133_CR26","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\u201396.","journal-title":"Genome Res"},{"issue":"9","key":"133_CR27","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\u201328.","journal-title":"Genome Res"},{"issue":"5","key":"133_CR28","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1089\/cmb.2014.0146","volume":"22","author":"N Nguyen","year":"2015","unstructured":"Nguyen N, Hickey G, Zerbino DR, Raney B, Earl D, Armstrong J, Kent WJ, Haussler D, Paten B. Building a pan-genome reference for a population. J Comput Biol. 2015;22(5):387\u2013401.","journal-title":"J Comput Biol"},{"key":"133_CR29","doi-asserted-by":"crossref","unstructured":"Haussler D, Smuga-Otto M, Paten B, Novak AM, Nikitin S, Zueva M, Miagkov D. A flow procedure for the linearization of genome sequence graphs. In: International conference on research in computational molecular biology. Berlin: Springer; 2017, p. 34\u201349.","DOI":"10.1007\/978-3-319-56970-3_3"},{"key":"133_CR30","series-title":"Annual symposium on combinatorial pattern matching","first-page":"46","volume-title":"Explaining and controlling ambiguity in dynamic programming","author":"R Giegerich","year":"2000","unstructured":"Giegerich R. Explaining and controlling ambiguity in dynamic programming. Annual symposium on combinatorial pattern matching. Berlin: Springer; 2000. p. 46\u201359."},{"key":"133_CR31","series-title":"The theory and practice of sequence comparison, reading","volume-title":"Time warps, string edits, and macromolecules","author":"D Sankoff","year":"1983","unstructured":"Sankoff D. Time warps, string edits, and macromolecules. The theory and practice of sequence comparison, reading. Boston: Addison-Wesley; 1983."},{"key":"133_CR32","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1093\/molbev\/msi134","volume":"22","author":"E Belda","year":"2005","unstructured":"Belda E, Moya A, Silva FJ. Genome rearrangement distances and gene order phylogeny in $$\\gamma$$ \u03b3 -proteobacteria. Mol Biol Evol. 2005;22:1456\u201367. https:\/\/doi.org\/10.1093\/molbev\/msi134 .","journal-title":"Mol Biol Evol"},{"key":"133_CR33","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/j.crvi.2011.05.011","volume":"334","author":"G Drillon","year":"2011","unstructured":"Drillon G, Fischer G. Comparative study on synteny between yeasts and vertebrates. C R Biol. 2011;334:629\u201338. https:\/\/doi.org\/10.1016\/j.crvi.2011.05.011 .","journal-title":"C R Biol"},{"key":"133_CR34","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1371\/journal.pgen.0020032","volume":"2","author":"G Fischer","year":"2006","unstructured":"Fischer G, Rocha EPC, Brunet F, Vergassola M, Dujon B. Highly variable rates of genome rearrangements between hemiascomycetous yeast lineages. PLoS Genet. 2006;2:32. https:\/\/doi.org\/10.1371\/journal.pgen.0020032 .","journal-title":"PLoS Genet"},{"key":"133_CR35","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/978-1-60327-159-2_18","volume":"452","author":"R Friedberg","year":"2008","unstructured":"Friedberg R, Darling AE, Yancopoulos S. Genome rearrangement by the double cut and join operation. Methods Mol Biol. 2008;452:385\u2013416.","journal-title":"Methods Mol Biol"},{"key":"133_CR36","doi-asserted-by":"publisher","first-page":"1003345","DOI":"10.1371\/journal.pcbi.1003345","volume":"9","author":"S El-Metwally","year":"2013","unstructured":"El-Metwally S, Hamza T, Zakaria M, Helmy M. Next-generation sequence assembly: four stages of data processing and computational challenges. PLoS Comput Biol. 2013;9:1003345. https:\/\/doi.org\/10.1371\/journal.pcbi.1003345 .","journal-title":"PLoS Comp Biol"},{"key":"133_CR37","series-title":"Complexity of computer computations","first-page":"85","volume-title":"Reducibility among combinatorial problems","author":"RM Karp","year":"1972","unstructured":"Karp RM. Reducibility among combinatorial problems. Complexity of computer computations. Berlin: Springer; 1972. p. 85\u2013103."},{"key":"133_CR38","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0020-0190(93)90079-O","volume":"47","author":"P Eades","year":"1993","unstructured":"Eades P, Lin X, Smyth WF. A fast and effective heuristic for the feedback arc set problem. Inf Process Lett. 1993;47:319\u201323.","journal-title":"Inf Process Lett"},{"key":"133_CR39","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1011315014322","volume":"7","author":"Y Saab","year":"2001","unstructured":"Saab Y. A fast and effective algorithm for the feedback arc set problem. J Heuristics. 2001;7:235\u201350. https:\/\/doi.org\/10.1023\/A:1011315014322 .","journal-title":"J Heuristics"},{"issue":"11","key":"133_CR40","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/368996.369025","volume":"5","author":"AB Kahn","year":"1962","unstructured":"Kahn AB. Topological sorting of large networks. Commun ACM. 1962;5(11):558\u201362.","journal-title":"Commun ACM"},{"key":"133_CR41","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16729-4","volume-title":"The linear ordering problem: exact and heuristic methods in combinatorial optimization","author":"R Mart\u00ed","year":"2011","unstructured":"Mart\u00ed R, Reinelt G. The linear ordering problem: exact and heuristic methods in combinatorial optimization, vol. 175. Berlin: Springer; 2011."},{"key":"133_CR42","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel M, J\u00fcnger M, Reinelt G. A cutting plane algorithm for the linear ordering problem. Oper Res. 1984;32:1195\u2013220.","journal-title":"Oper Res"},{"key":"133_CR43","doi-asserted-by":"publisher","first-page":"72","DOI":"10.2307\/1412159","volume":"15","author":"C Spearman","year":"1904","unstructured":"Spearman C. The proof and measurement of association between two things. Am J Psychol. 1904;15:72\u2013101.","journal-title":"Am J Psychol"},{"key":"133_CR44","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1093\/biomet\/30.1-2.81","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall MG. A new measure of rank correlation. Biometrika. 1938;30:81\u201393.","journal-title":"Biometrika"},{"key":"133_CR45","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/S0895480102412856","volume":"17","author":"R Fagin","year":"2003","unstructured":"Fagin R, Kumar R, Sivakumar D. Comparing top $$k$$ k lists. SIAM J Discrete Math. 2003;17:134\u201360. https:\/\/doi.org\/10.1137\/S0895480102412856 .","journal-title":"SIAM J Discrete Math"},{"key":"133_CR46","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1021\/ci030411+","volume":"44","author":"C Fried","year":"2004","unstructured":"Fried C, Hordijk W, Prohaska SJ, Stadler CR, Stadler PF. The footprint sorting problem. J Chem Inf Comput Sci. 2004;44:332\u20138.","journal-title":"J Chem Inf Comput Sci"},{"key":"133_CR47","doi-asserted-by":"publisher","unstructured":"Collier JH, Konagurthu AS. An information measure for comparing top k lists. In: 2014 IEEE 10th international conference on e-science, vol. 1. 2014, p. 127\u201334. https:\/\/doi.org\/10.1109\/eScience.2014.39 .","DOI":"10.1109\/eScience.2014.39"},{"key":"133_CR48","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1089\/cmb.2009.0094","volume":"16","author":"D Bertrand","year":"2009","unstructured":"Bertrand D, Blanchette M, El-Mabrouk N. Genetic map refinement using a comparative genomic approach. J Comput Biol. 2009;16:1475\u201386.","journal-title":"J Comput Biol"},{"key":"133_CR49","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.tcs.2008.12.039","volume":"410","author":"M Oswald","year":"2009","unstructured":"Oswald M, Reinelt G. The simultaneous consecutive ones problem. Theor Comput Sci. 2009;410:21\u20133.","journal-title":"Theor Comput Sci"},{"key":"133_CR50","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth KS, Lueker GS. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J Comput Syst Sci. 1976;13:335\u201379.","journal-title":"J Comput Syst Sci"},{"key":"133_CR51","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0166-218X(98)00078-X","volume":"88","author":"J Meidanis","year":"1998","unstructured":"Meidanis J, Porto O, Telles GP. On the consecutive ones property. Discrete Appl Math. 1998;88:325\u201354.","journal-title":"Discrete Appl Math"},{"key":"133_CR52","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(72)90019-6","volume":"12","author":"A Tucker","year":"1972","unstructured":"Tucker A. A structure theorem for the consecutive 1\u2019s property. J Comb Theory B. 1972;12:153\u201362.","journal-title":"J Comb Theory B"},{"key":"133_CR53","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-69346-7_17","volume-title":"Integer Programming and Combinatorial Optimization","author":"Thomas Christof","year":"1998","unstructured":"Christof T, Oswald M, Reinelt G. Consecutive ones and a betweenness problem in computational biology. In: Bixby RE, Boyd EA, R\u00edos-Mercado RZ, eds. Integer programming and combinatorial optimization, vol. 1412. 1998, p. 213\u201328."},{"key":"133_CR54","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1137\/050629938","volume":"28","author":"JK Reid","year":"2006","unstructured":"Reid JK, Scott JA. Reducing the total bandwidth of a sparse unsymmetric matrix. SIAM J Matrix Anal Appl. 2006;28:805\u201321.","journal-title":"SIAM J Matrix Anal Appl"},{"key":"133_CR55","doi-asserted-by":"publisher","unstructured":"Cuthill E, McKee J. Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of 24th National Conference ACM. New York: ACM; 1969, p. 157\u201372. https:\/\/doi.org\/10.1145\/800195.805928 .","DOI":"10.1145\/800195.805928"},{"key":"133_CR56","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1137\/0713023","volume":"13","author":"NE Gibbs","year":"1976","unstructured":"Gibbs NE, Poole WG Jr, Stockmeyer PK. An algorithm for reducing bandwidth and profile reduction algorithms. SIAM J Numer Anal. 1976;13:236\u201350.","journal-title":"SIAM J Numer Anal"},{"key":"133_CR57","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-44985-X_2","volume-title":"Algorithm Theory - SWAT 2000","author":"Uriel Feige","year":"2000","unstructured":"Feige U. Coping with the NP-hardness of the graph bandwidth problem. In: Algorithm Theory\u2014SWAT 2000, vol. 1851. 2000, p. 129\u201345."},{"issue":"1","key":"133_CR58","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1186\/1471-2105-15-99","volume":"15","author":"B Kehr","year":"2014","unstructured":"Kehr B, Trappe K, Holtgrewe M, Reinert K. Genome alignment with graph data structures: a comparison. BMC Bioinf. 2014;15(1):99.","journal-title":"BMC Bioinf"},{"key":"133_CR59","unstructured":"Gavril F. Some NP-complete problems on graphs. In: Proceedings of the 11th Conference on Information Sciences and Systems. Baltimore: Johns Hopkins University; 1977, p. 91\u20135."},{"key":"133_CR60","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0606044","volume":"6","author":"FS Makedon","year":"1985","unstructured":"Makedon FS, Papadimitriou CH, Sudbourough IH. Topological bandwidth. SIAM J Algebraic Discrete Methods. 1985;6:418\u201344.","journal-title":"SIAM J Algebraic Discrete Methods"},{"key":"133_CR61","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.cor.2012.05.016","volume":"40","author":"R Mart\u00ed","year":"2013","unstructured":"Mart\u00ed R, Pantrigo JJ, Duarte A, Pardo EG. Branch and bound for the cutwidth minimization problem. Comput Oper Res. 2013;40:137\u201349.","journal-title":"Comput Oper Res"},{"key":"133_CR62","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1051\/ita\/1995290604871","volume":"29","author":"D Barth","year":"1995","unstructured":"Barth D, Pellegrini F, Raspaud A, Roman J. On bandwidth, cutwidth, and quotient graphs. Informatique th\u00e9orique et applications. 1995;29:487\u2013508.","journal-title":"Informatique th\u00e9orique et applications"},{"key":"133_CR63","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0208008","volume":"8","author":"J Opatrny","year":"1979","unstructured":"Opatrny J. Total ordering problem. SIAM J Comput. 1979;8:111\u20134.","journal-title":"SIAM J Comput"},{"key":"133_CR64","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1137\/S0895480195296221","volume":"11","author":"B Chor","year":"1998","unstructured":"Chor B, Sudan M. A geometric approach to betweenness. SIAM J Discr Math. 1998;11:511\u201323.","journal-title":"SIAM J Discr Math"},{"key":"133_CR65","doi-asserted-by":"publisher","first-page":"293","DOI":"10.2307\/276978","volume":"16","author":"WS Robinson","year":"1951","unstructured":"Robinson WS. A method for chronologically ordering archaeological deposits. Amer Antiquity. 1951;16:293\u2013301.","journal-title":"Amer Antiquity"},{"key":"133_CR66","doi-asserted-by":"publisher","first-page":"1220","DOI":"10.1016\/j.dam.2007.05.023","volume":"156","author":"P Bertrand","year":"2008","unstructured":"Bertrand P. Systems of sets such that each set properly intersects at most one other set\u2014application to cluster analysis. Discrete Appl Math. 2008;156:1220\u201336.","journal-title":"Discrete Appl Math"},{"key":"133_CR67","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.dam.2016.12.019","volume":"222","author":"P Bertrand","year":"2017","unstructured":"Bertrand P, Diatta J. Multilevel clustering models and interval convexities. Discrete Appl Math. 2017;222:54\u201366. https:\/\/doi.org\/10.1016\/j.dam.2016.12.019 .","journal-title":"Discrete Appl Math"},{"key":"133_CR68","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1002\/sam.10071","volume":"3","author":"I Liiv","year":"2010","unstructured":"Liiv I. Seriation and matrix reordering methods: an historical overview. Stat Anal Data Min. 2010;3:70\u201391.","journal-title":"Stat Anal Data Min"},{"key":"133_CR69","doi-asserted-by":"publisher","first-page":"3","DOI":"10.18637\/jss.v025.i03","volume":"25","author":"M Hahsler","year":"2008","unstructured":"Hahsler M, Hornik K, Buchta C. Getting things in order: an introduction to the R package seriation. J Stat Softw. 2008;25:3.","journal-title":"J Stat Softw"},{"key":"133_CR70","first-page":"338","volume-title":"Lecture Notes in Computer Science","author":"Taku Onodera","year":"2013","unstructured":"Onodera T, Sadakane K, Shibuya T. Detecting superbubbles in assembly graphs. In: International workshop on algorithms in bioinformatics. Berlin: Springer; 2013, p. 338\u201348."},{"key":"133_CR71","doi-asserted-by":"crossref","unstructured":"Paten B, Novak AM, Garrison E, Hickey G. Superbubbles, ultrabubbles and cacti. In: International conference on research in computational molecular biology. Berlin: Springer; 2017, p. 173\u201389.","DOI":"10.1007\/978-3-319-56970-3_11"},{"issue":"6","key":"133_CR72","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1101\/gr.229102","volume":"12","author":"WJ Kent","year":"2002","unstructured":"Kent WJ, Sugnet CW, Furey TS, Roskin KM, Pringle TH, Zahler AM, Haussler D. The human genome browser at ucsc. Genome Res. 2002;12(6):996\u20131006.","journal-title":"Genome Res"},{"key":"133_CR73","first-page":"115","volume":"7","author":"F Chiaromonte","year":"2001","unstructured":"Chiaromonte F, Yap V, Miller W. Scoring pairwise genomic sequence alignments. Pac Symp Biocomput. 2001;7:115.","journal-title":"Pac Symp Biocomput"},{"key":"133_CR74","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1017\/S1355838299981682","volume":"5","author":"M Spingola","year":"1999","unstructured":"Spingola M, Grate L, Haussler D, Ares M Jr. Genome-wide bioinformatic and molecular analysis of introns in Saccharomyces cerevisiae. RNA. 1999;5:221\u201334.","journal-title":"RNA"},{"issue":"5","key":"133_CR75","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1042\/bj0510614","volume":"51","author":"H Krebs","year":"1952","unstructured":"Krebs H, Gurin S, Eggleston L. The pathway of oxidation of acetate in Baker\u2019s yeast. Biochem J. 1952;51(5):614.","journal-title":"Biochem J"},{"key":"133_CR76","unstructured":"Saccharomyces Genome Database Community: SGD Yeast Pathway: Saccharomyces cerevisiae TCA cycle, aerobic respiration. http:\/\/pathway.yeastgenome.org\/YEAST\/NEW-IMAGE?object=TCA-EUK-PWY . Accessed 18 May 2017."},{"issue":"16","key":"133_CR77","doi-asserted-by":"crossref","first-page":"12116","DOI":"10.1016\/S0021-9258(19)50315-5","volume":"268","author":"RJ Haselbeck","year":"1993","unstructured":"Haselbeck RJ, McAlister-Henn L. Function and expression of yeast mitochondrial nad-and nadp-specific isocitrate dehydrogenases. J Biol Chem. 1993;268(16):12116\u201322.","journal-title":"J Biol Chem"},{"issue":"50","key":"133_CR78","doi-asserted-by":"publisher","first-page":"31382","DOI":"10.1074\/jbc.272.50.31382","volume":"272","author":"KS Oyedotun","year":"1997","unstructured":"Oyedotun KS, Lemire BD. The carboxyl terminus of the Saccharomyces cerevisiae succinate dehydrogenase membrane subunit, sdh4p, is necessary for ubiquinone reduction and enzyme stability. J Biol Chem. 1997;272(50):31382\u20138.","journal-title":"J Biol Chem"},{"issue":"38","key":"133_CR79","doi-asserted-by":"publisher","first-page":"36897","DOI":"10.1074\/jbc.M304091200","volume":"278","author":"Y Yasutake","year":"2003","unstructured":"Yasutake Y, Watanabe S, Yao M, Takada Y, Fukunaga N, Tanaka I. Crystal structure of the monomeric isocitrate dehydrogenase in the presence of nadp+ insight into the cofactor recognition, catalysis, and evolution. J Biol Chem. 2003;278(38):36897\u2013904.","journal-title":"J Biol Chem"},{"key":"133_CR80","doi-asserted-by":"publisher","first-page":"2077","DOI":"10.1101\/gr.174920.114","volume":"24","author":"D Earl","year":"2014","unstructured":"Earl D, Nguyen N, Hickey G, Harris RS, Fitzgerald S, Beal K, Seledtsov I, Molodtsov V, Raney BJ, Clawson H, Kim J, Kemena C, Chang JM, Erb I, Poliakov A, Hou M, Herrero J, Kent WJ, Solovyev V, Darling AE, Ma J, Notredame C, Brudno M, Dubchak I, Haussler D, Paten B. Alignathon: a competitive assessment of whole-genome alignment methods. Genome Res. 2014;24:2077\u201389. https:\/\/doi.org\/10.1101\/gr.174920.114 .","journal-title":"Genome Res"},{"key":"133_CR81","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1186\/s12859-016-0945-5","volume":"17","author":"K Ezawa","year":"2016","unstructured":"Ezawa K. Characterization of multiple sequence alignment errors using complete-likelihood score and position-shift map. BMC Bioinf. 2016;17:133. https:\/\/doi.org\/10.1186\/s12859-016-0945-5 .","journal-title":"BMC Bioinf"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-018-0133-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13015-018-0133-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-018-0133-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T20:39:04Z","timestamp":1752007144000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-018-0133-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,24]]},"references-count":81,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["133"],"URL":"https:\/\/doi.org\/10.1186\/s13015-018-0133-4","relation":{},"ISSN":["1748-7188"],"issn-type":[{"type":"electronic","value":"1748-7188"}],"subject":[],"published":{"date-parts":[[2018,9,24]]},"assertion":[{"value":"14 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"15"}}