{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:32:10Z","timestamp":1725471130894},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540395836"},{"type":"electronic","value":"9783540395843"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11851561_13","type":"book-chapter","created":{"date-parts":[[2006,9,22]],"date-time":"2006-09-22T12:49:41Z","timestamp":1158929381000},"page":"138-149","source":"Crossref","is-referenced-by-count":4,"title":["Controlling Size When Aligning Multiple Genomic Sequences with Duplications"],"prefix":"10.1007","author":[{"given":"Minmei","family":"Hou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Berman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louxin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Webb","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/3-540-08860-1_6","volume-title":"Automata, Languages and Programming","author":"P. Berman","year":"1978","unstructured":"Berman, P.: Relationship between density and deterministic complexity of NP-complete languages. In: Ausiello, G., B\u00f6hm, C. (eds.) ICALP 1978. LNCS, vol.\u00a062, pp. 63\u201371. Springer, Heidelberg (1978)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1101\/gr.1933104","volume":"14","author":"M. Blanchette","year":"2004","unstructured":"Blanchette, M., et al.: Aligning multiple genomic sequences with the threaded blockset aligner. Genome Research\u00a014, 708\u2013715 (2004)","journal-title":"Genome Research"},{"key":"13_CR3","first-page":"97","volume":"19A","author":"L. Cacceta","year":"1985","unstructured":"Cacceta, L., Erdos, P., Ordman, E.T., Pullman, N.J.: On the difference between clique numbers of a graph. Ars Combinatoria\u00a019A, 97\u2013106 (1985)","journal-title":"Ars Combinatoria"},{"key":"13_CR4","unstructured":"Cavers, M.: Clique partitions and coverings of graphs (Masters thesis, University of Waterloo) (2005)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1101\/gr.3577405","volume":"15","author":"G.M. Cooper","year":"2005","unstructured":"Cooper, G.M., et al.: Distribution and intensity of constraint in mammalian genomic sequences. Genome Research\u00a015, 901\u2013913 (2005)","journal-title":"Genome Research"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.2307\/2412448","volume":"19","author":"W.M. Fitch","year":"1970","unstructured":"Fitch, W.M.: Distinguishing homologous from analogous proteins. Syst. Zool.\u00a019, 99\u2013113 (1970)","journal-title":"Syst. Zool."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0168-9525(00)02005-9","volume":"16","author":"W.M. Fitch","year":"2000","unstructured":"Fitch, W.M.: Homology, a personal view on some problems. Trends Genet.\u00a016, 227\u2013231 (2000)","journal-title":"Trends Genet."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Gramm, J., et al.: Data reduction, exact, and heuristic algorithms for clique cover. In: ALENEX, pp. 86\u201394 (2006)","DOI":"10.1137\/1.9781611972863.9"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0012-365X(82)90085-1","volume":"41","author":"D.A. Gregory","year":"1982","unstructured":"Gregory, D.A., Pullman, N.J.: On a clique covering problem of Orlin. Discrete Math.\u00a041, 97\u201399 (1982)","journal-title":"Discrete Math."},{"key":"13_CR10","first-page":"801","volume":"47","author":"M. Hall Jr.","year":"1941","unstructured":"Hall Jr., M.: A problem in partition. Bull. Amer. Math. Soc.\u00a047, 801\u2013807 (1941)","journal-title":"Bull. Amer. Math. Soc."},{"key":"13_CR11","unstructured":"Hou, M., et al.: Aligning multiple genomic sequences that contain duplications (manuscript)"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"9830","DOI":"10.1073\/pnas.0503401102","volume":"102","author":"J.R. Hughes","year":"2005","unstructured":"Hughes, J.R., et al.: Annotation of cis-regulatory elements by identification, subclassification, and functional assessment of multispecies conserved sequences. Proc. Natl. Acad. Sci. USA\u00a0102, 9830\u20139835 (2005)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/359340.359346","volume":"21","author":"L.T. Kou","year":"1978","unstructured":"Kou, L.T., et al.: Covering edges by cliques with regard to keyword conflicts and intersection graphs. Communications of the ACM\u00a021(2), 135\u2013139 (1978)","journal-title":"Communications of the ACM"},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1145\/185675.306789","volume":"41","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: On the hardness of approximation minimization problems. J. Assoc. for Comput. Mach.\u00a041, 961\u2013981 (1994)","journal-title":"J. Assoc. for Comput. Mach."},{"key":"13_CR15","unstructured":"Margulies, E.H., et al.: Relationship between evolutionary constraint and genome function in 1% of the human genome. Nature (submitted)"},{"key":"13_CR16","unstructured":"Margulies, E.H., et al.: Annotation of the human genome through comparisons of diverse mammalian sequences. Genome Research (submitted)"},{"key":"13_CR17","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1016\/1385-7258(77)90055-5","volume":"39","author":"J. Orlin","year":"1977","unstructured":"Orlin, J.: Contentment in graph theory: covering graphs with cliques. Indag. Math.\u00a039, 406\u2013424 (1977)","journal-title":"Indag. Math."},{"key":"13_CR18","first-page":"207","volume":"19","author":"N.J. Pullman","year":"1981","unstructured":"Pullman, N.J., Donald, A.: Clique coverings of graphs II: complements of cliques. Utilitas Math.\u00a019, 207\u2013213 (1981)","journal-title":"Utilitas Math."},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/0213005","volume":"13","author":"N.J. Pullman","year":"1984","unstructured":"Pullman, N.J.: Clique coverings of graphs IV: algorithms. SIAM J. on Computing\u00a013, 57\u201375 (1984)","journal-title":"SIAM J. on Computing"},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1101\/gr.809403","volume":"13","author":"S. Schwartz","year":"2003","unstructured":"Schwartz, S., et al.: Human-Mouse Alignments with BLASTZ. Genome Res.\u00a013(1), 103\u2013107 (2003)","journal-title":"Genome Res."},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1101\/gr.3715005","volume":"15","author":"A. Siepel","year":"2005","unstructured":"Siepel, A., et al.: Evolutionarily conserved elements in vertebrate, insect, worm, and yeast genomes. Genome Research\u00a015, 1034\u20131050 (2005)","journal-title":"Genome Research"},{"key":"13_CR22","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1126\/science.1105136","volume":"306","author":"The ENCODE Project Consortium","year":"2004","unstructured":"The ENCODE Project Consortium: The ENCODE (ENCyclopedia of DNA Elements) Project. Science\u00a0306, 636\u2013640 (2004)","journal-title":"Science"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1186\/1471-2105-6-130","volume":"6","author":"M.J. Wakefield","year":"2005","unstructured":"Wakefield, M.J., Maxwell, P., Huttley, G.A.: Vestige: maximum likelihood phylogenetic footprinting. BMC Bioinformatics\u00a06, 130 (2005)","journal-title":"BMC Bioinformatics"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11851561_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:38Z","timestamp":1619507978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11851561_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540395836","9783540395843"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11851561_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}