{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T01:32:32Z","timestamp":1777512752690,"version":"3.51.4"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5829,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1016\/s0304-3975(97)00023-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"233-244","source":"Crossref","is-referenced-by-count":31,"title":["Approximation algorithms for multiple sequence alignment"],"prefix":"10.1016","volume":"182","author":[{"given":"Vineet","family":"Bafna","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugene","family":"L. Lawler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel A.","family":"Pevzner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00023-6_BIB1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1137\/0149012","article-title":"Trees, stars, and multiple biological sequence alignment","volume":"49","author":"Altschul","year":"1989","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0304-3975(97)00023-6_BIB2","series-title":"Proc. of the 5th Annual Symp. on Combin. Pattern Matching (CPM'94)","first-page":"43","article-title":"Approximation Algorithms for Multiple Sequence Alignment","volume":"vol. 807","author":"Bafha","year":"1994"},{"key":"10.1016\/S0304-3975(97)00023-6_BIB3","series-title":"Infinite and Finite Sets","first-page":"91","article-title":"On the factorization of the complete uniform hypergraph","author":"Baranyai","year":"1975"},{"key":"10.1016\/S0304-3975(97)00023-6_BIB4","series-title":"Decompositions of Graphs","author":"B\u00f3sak","year":"1990"},{"key":"10.1016\/S0304-3975(97)00023-6_BIB5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal classes of hash functions","volume":"18","author":"Carter","year":"1979","journal-title":"J. Comput. System sci."},{"key":"10.1016\/S0304-3975(97)00023-6_BIB6","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/BF02459635","article-title":"A survey of multiple sequence comparison methods","volume":"54","author":"Chan","year":"1992","journal-title":"Bull. Math. Biol."},{"key":"10.1016\/S0304-3975(97)00023-6_BIB7","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/BF02603120","article-title":"Progressive sequence alignment as a prerequisite to correct phylogenetic trees","volume":"25","author":"Feng","year":"1987","journal-title":"J. Molec. Evol."},{"key":"10.1016\/S0304-3975(97)00023-6_BIB8","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/BF02102483","article-title":"An NTP-binding motif is the most conserved sequence in a highly diverged monophyletic group of proteins involved in positive strand RNA viral replication","volume":"28","author":"Gorbalenya","year":"1989","journal-title":"J. Molec. Evol."},{"key":"10.1016\/S0304-3975(97)00023-6_BIB9","article-title":"Efficient methods for multiple sequence alignment with guaranteed error bounds","author":"Gusfield","year":"1991","journal-title":"Tech. Report, Computer Science Division, University of California, Davis, CSE-91-94"},{"key":"10.1016\/S0304-3975(97)00023-6_BIB10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02460299","article-title":"Efficient methods for multiple sequence alignment with guaranteed error bounds","volume":"55","author":"Gusfield","year":"1993","journal-title":"Bulletin of Mathematical Biology"},{"key":"10.1016\/S0304-3975(97)00023-6_BIB11","series-title":"Proc. ACM STOC'94","first-page":"760","article-title":"Aligning sequences via an evolutionary tree: complexity and approximation","author":"Jiang","year":"1994"},{"key":"10.1016\/S0304-3975(97)00023-6_BIB12","series-title":"Combinatorial Pattern Matching 93","first-page":"106","article-title":"The maximum weight trace alignment problem in multiple sequence alignment","volume":"vol. 684","author":"Kececioglu","year":"1993"},{"key":"10.1016\/S0304-3975(97)00023-6_BIB13","first-page":"4412","article-title":"A tool for multiple sequence alignment","volume":"86","author":"Lipman","year":"1989"},{"key":"10.1016\/S0304-3975(97)00023-6_BIB14","series-title":"Proc. 2nd Internat. Conf. Theory of Groups","first-page":"432","article-title":"Finite projective planes and sharply 2-transitive subsets of finite groups","author":"Lorimer","year":"1973"},{"key":"10.1016\/S0304-3975(97)00023-6_BIB15","doi-asserted-by":"crossref","first-page":"1763","DOI":"10.1137\/0152101","article-title":"Multiple alignment, communication cost, and graph matching","volume":"52","author":"Pevzner","year":"1992","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0304-3975(97)00023-6_BIB16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1137\/0128004","article-title":"Minimum mutation tree of sequences","volume":"28","author":"Sankoff","year":"1975","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0304-3975(97)00023-6_BIB17","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1137\/0145048","article-title":"Simultaneous solution of the RNA folding, alignment and protosequence problems","volume":"45","author":"Sankoff","year":"1985","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0304-3975(97)00023-6_BIB18","series-title":"Proc. 22nd ACM Symp. on Theory of Computing","first-page":"224","article-title":"The analysis closed hashing under limited randomness","author":"Schmidt","year":"1990"},{"key":"10.1016\/S0304-3975(97)00023-6_BIB19","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1016\/0076-6879(90)83031-4","article-title":"Hierarchical method to align large numbers of biological sequences","volume":"183","author":"Taylor","year":"1990","journal-title":"Methods Enzymol."},{"key":"10.1016\/S0304-3975(97)00023-6_BIB20","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1089\/cmb.1994.1.337","article-title":"On the complexity of multiple sequence alignment","volume":"1","author":"Wang","year":"1994","journal-title":"J. Comp. Biol."},{"key":"10.1016\/S0304-3975(97)00023-6_BIB21","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0001-8708(76)90202-4","article-title":"Some biological sequence metrics","volume":"20","author":"Waterman","year":"1976","journal-title":"Adv. in Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000236?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000236?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T03:25:45Z","timestamp":1556508345000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000236"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0304397597000236"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00023-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}