{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:23Z","timestamp":1725512123730},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540797227"},{"type":"electronic","value":"9783540797234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79723-4_8","type":"book-chapter","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T10:22:17Z","timestamp":1210069337000},"page":"66-77","source":"Crossref","is-referenced-by-count":0,"title":["New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem"],"prefix":"10.1007","author":[{"given":"Maw-Shang","family":"Chang","sequence":"first","affiliation":[]},{"given":"Chuang-Chieh","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Rossmanith","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Dor, A., Chor, B., Graur, D., Ophir, R., Pelleg, D.: From four-taxon trees to phylogenies: The case of mammalian evolution. In: Proceedings of the RECOMB, pp. 9\u201319 (1998)","DOI":"10.1145\/279069.279078"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-8858(86)90038-2","volume":"7","author":"H.J. Bandelt","year":"1986","unstructured":"Bandelt, H.J., Dress, A.: Reconstructing the shape of a tree from observed dissimilarity date. Adv. Appl. Math.\u00a07, 309\u2013343 (1986)","journal-title":"Adv. Appl. Math."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/3-540-48481-7_28","volume-title":"Algorithms - ESA\u201999","author":"V. Berry","year":"1999","unstructured":"Berry, V., Jiang, T., Kearney, P.E., Li, M., Wareham, H.T.: Quartet cleaning: Improved algorithms and simulations. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 313\u2013324. Springer, Heidelberg (1999)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","first-page":"36","volume-title":"SOFSEM \u201998: Theory and Practice of Informatics","author":"B. Cho","year":"1998","unstructured":"Cho, B.: From quartets to phylogenetic trees. In: Rovan, B. (ed.) SOFSEM 1998. LNCS, vol.\u00a01521, pp. 36\u201353. Springer, Heidelberg (1998)"},{"key":"8_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1002\/(SICI)1098-2418(199903)14:2<153::AID-RSA3>3.0.CO;2-R","volume":"14","author":"P. Erd\u0151s","year":"1999","unstructured":"Erd\u0151s, P., Steel, M., Sz\u00e9kely, L., Warnow, T.: A few logs suffice to build (almost) all trees (Part 1). Random Struct. Alg.\u00a014, 153\u2013184 (1999)","journal-title":"Random Struct. Alg."},{"key":"8_CR7","unstructured":"Greene, D.H., Knuth, D.E.: Mathematics for the Analysis of Algorithms, 2nd edn. Progress in Computer Science. Birkhauser, Boston (1982)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/S0022-0000(03)00077-1","volume":"67","author":"J. Gramm","year":"2003","unstructured":"Gramm, J., Niedermeier, R.: A fixed-parameter algorithm for minimum quartet inconsistency. J. Comput. System Sci.\u00a067, 723\u2013741 (2003)","journal-title":"J. Comput. System Sci."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1006\/jagm.1999.1050","volume":"34","author":"T. Jiang","year":"2000","unstructured":"Jiang, T., Kearney, P.E., Li, M.: Some open problems in computational molecular biology. J. Algorithms\u00a034, 194\u2013201 (2000)","journal-title":"J. Algorithms"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1137\/S0097539799361683","volume":"30","author":"T. Jiang","year":"2001","unstructured":"Jiang, T., Kearney, P.E., Li, M.: A polynomial time approximation scheme for inferring evolutionary tree from quartet topologies and its application. SIAM J. Comput.\u00a030, 1942\u20131961 (2001)","journal-title":"SIAM J. Comput."},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"M. Steel","year":"1992","unstructured":"Steel, M.: The complexity of reconstructing trees from qualitative characters and subtrees. J. Classification\u00a09, 91\u2013116 (1992)","journal-title":"J. Classification"},{"key":"8_CR12","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(00)00004-1","volume":"73","author":"R. Niedermeier","year":"2000","unstructured":"Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parameter algorithms. Inform. Process. Lett.\u00a073, 125\u2013129 (2000)","journal-title":"Inform. Process. Lett."},{"key":"8_CR14","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/11557067_6","volume-title":"Algorithms in Bioinformatics","author":"G. Wu","year":"2005","unstructured":"Wu, G., You, J.-H., Lin, G.: A lookahead branch-and-bound algorithm for the maximum quartet consistency problem. In: Casadio, R., Myers, G. (eds.) WABI 2005. LNCS (LNBI), vol.\u00a03692, pp. 65\u201376. Springer, Heidelberg (2005)"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.ipl.2006.05.013","volume":"100","author":"G. Wu","year":"2006","unstructured":"Wu, G., You, J.-H., Lin, G.: A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors. Inform. Process. Lett.\u00a0100, 167\u2013171 (2006)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79723-4_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:30:04Z","timestamp":1619523004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79723-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540797227","9783540797234"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79723-4_8","relation":{},"subject":[]}}