{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:52:52Z","timestamp":1725475972643},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340751"},{"type":"electronic","value":"9783540340768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11751595_67","type":"book-chapter","created":{"date-parts":[[2006,5,11]],"date-time":"2006-05-11T10:27:59Z","timestamp":1147343279000},"page":"631-637","source":"Crossref","is-referenced-by-count":0,"title":["The Bottleneck Tree Alignment Problems"],"prefix":"10.1007","author":[{"given":"Yen Hung","family":"Chen","sequence":"first","affiliation":[]},{"given":"Chuan Yi","family":"Tang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"67_CR1","doi-asserted-by":"crossref","unstructured":"Aho, A.V.: Algorithms for finding patterns in strings. Handbook of Theoretical Computer Science. Algorithms and Complexity, vol.\u00a0A, pp. 290\u2013300 (1990)","DOI":"10.1016\/B978-0-444-88071-0.50010-2"},{"key":"67_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(99)00324-2","volume":"259","author":"P. Bonizzoni","year":"2001","unstructured":"Bonizzoni, P., Vedova, G.D.: The complexity of multiple sequence alignment with SP-score that is a metric. Theoretical Computer Science\u00a0259, 63\u201379 (2001)","journal-title":"Theoretical Computer Science"},{"key":"67_CR3","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/BF02459635","volume":"54","author":"S.C. Chan","year":"1992","unstructured":"Chan, S.C., Wong, A.K.C., Chiu, D.K.T.: A survey of multiple sequence comparison methods. Bulletin of Mathematical Biology\u00a054, 563\u2013598 (1992)","journal-title":"Bulletin of Mathematical Biology"},{"key":"67_CR4","volume-title":"Introduction to Algorithm","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithm, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"67_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)"},{"key":"67_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0304-3975(97)00240-5","volume":"230","author":"C. Higuera","year":"2000","unstructured":"Higuera, C., Casacuberta, F.: Topology of strings: median string is NP-complete. Theoretical Computer Science\u00a0230, 39\u201348 (2000)","journal-title":"Theoretical Computer Science"},{"key":"67_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2022.001.0001","volume-title":"Computational Molecular Biology: An Algorithmic Approach","author":"P.A. Pevzner","year":"2000","unstructured":"Pevzner, P.A.: Computational Molecular Biology: An Algorithmic Approach. The MIT Press, Cambridge (2000)"},{"key":"67_CR8","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0166-218X(98)00079-1","volume":"88","author":"R. Ravi","year":"1998","unstructured":"Ravi, R., Kececioglu, J.: Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree. Discrete Applied Mathematics\u00a088, 355\u2013366 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"67_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1137\/0128004","volume":"28","author":"D. Sankoff","year":"1975","unstructured":"Sankoff, D.: Minimal mutation trees of sequences. SIAM Journal on Applied Mathematics\u00a028, 35\u201342 (1975)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"67_CR10","volume-title":"Time warps, string edits, and macromolecules: the theory and practice of sequence comparison","author":"D. Sankoff","year":"1983","unstructured":"Sankoff, D., Kruskal, J.: Time warps, string edits, and macromolecules: the theory and practice of sequence comparison. Addison-Wesley, Reading (1983)"},{"key":"67_CR11","unstructured":"Setubal, J., Meidanis, J.: Introduction to computational molecular biology. PWS Publishing Company (1997)"},{"key":"67_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1089\/cmb.1994.1.337","volume":"1","author":"L. Wang","year":"1994","unstructured":"Wang, L., Jiang, J.: On the complexity of multiple sequence alignment. Journal of Computational Biology\u00a01, 337\u2013348 (1994)","journal-title":"Journal of Computational Biology"},{"key":"67_CR13","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF01955679","volume":"16","author":"L. Wang","year":"1996","unstructured":"Wang, L., Jiang, T., Lawler, E.L.: Approximation algorithms for tree alignment with a given phylogeny. Algorithmica\u00a016, 302\u2013315 (1996)","journal-title":"Algorithmica"},{"key":"67_CR14","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1006\/jagm.1997.0882","volume":"25","author":"L. Wang","year":"1997","unstructured":"Wang, L., Gusfield, D.: Improved approximation algorithms for tree alignment. Journal of Algorithm\u00a025, 255\u2013273 (1997)","journal-title":"Journal of Algorithm"},{"key":"67_CR15","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1137\/S0097539796313507","volume":"30","author":"L. Wang","year":"2000","unstructured":"Wang, L., Jiang, J., Gusfield, D.: A more efficient approximation scheme for tree alignment. SIAM Journal on Computing\u00a030, 283\u2013299 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"67_CR16","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R. Wagner","year":"1974","unstructured":"Wagner, R., Fisher, M.: The string-to-string correction problem. Journal of the ACM\u00a021, 168\u2013178 (1974)","journal-title":"Journal of the ACM"},{"key":"67_CR17","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1009885610075","volume":"3","author":"B.Y. Wu","year":"1999","unstructured":"Wu, B.Y., Chao, K.M., Tang, C.Y.: Approximation and exact algorithms for constructing minimum ultrametric trees from distance matrices. Journal of Combinatorial Optimization\u00a03, 199\u2013211 (1999)","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11751595_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:00:09Z","timestamp":1619492409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11751595_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340751","9783540340768"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11751595_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}