{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:26:04Z","timestamp":1757456764006},"reference-count":28,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":6072,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1996,12]]},"DOI":"10.1016\/s0166-218x(96)00072-8","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"337-365","source":"Crossref","is-referenced-by-count":6,"title":["Local multiple alignment via subgraph enumeration"],"prefix":"10.1016","volume":"71","author":[{"given":"Z.","family":"Zhang","sequence":"first","affiliation":[]},{"given":"B.","family":"He","sequence":"additional","affiliation":[]},{"given":"W.","family":"Miller","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00072-8_BIB1","first-page":"247","article-title":"Analysis of conserved domains and sequence motifs in cellular regulatory proteins and locus control regions using new software tools for multiple alignment and visualization","volume":"4","author":"Boguski","year":"1992","journal-title":"New Biologist"},{"key":"10.1016\/S0166-218X(96)00072-8_BIB2","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","article-title":"Algorithm 457: finding all cliques of an undirected graph","volume":"16","author":"Bron","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/S0166-218X(96)00072-8_BIB3","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/BF01188583","article-title":"Linear-space algorithms that build local alignments from fragments","volume":"13","author":"Chao","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(96)00072-8_BIB4","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0166-218X(96)00072-8_BIB5","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1145\/146637.146650","article-title":"Sparse dynamic programming. I: linear cost functions, II: convex and concave cost functions","volume":"39","author":"Eppstein","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(96)00072-8_BIB6","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(96)00072-8_BIB7","series-title":"Efficient Algorithms for Listing Combinatorial Structures","author":"Goldberg","year":"1993"},{"key":"10.1016\/S0166-218X(96)00072-8_BIB8","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1089\/cmb.1995.2.459","article-title":"Improving the practical space and time efficiency of the shortest-paths approach to sum-of-pairs multiple sequence alignment","volume":"2","author":"Gupta","year":"1995","journal-title":"J. Computat. Biol."},{"key":"10.1016\/S0166-218X(96)00072-8_BIB9","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":"Bull. Math. Biol."},{"key":"10.1016\/S0166-218X(96)00072-8_BIB10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n52 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(96)00072-8_BIB11","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0196-8858(91)90017-D","article-title":"A time-efficient, linear-space local similarity algorithm","volume":"12","author":"Huang","year":"1991","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0166-218X(96)00072-8_BIB12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","article-title":"On generating all maximal independent sets","volume":"27","author":"Johnson","year":"1988","journal-title":"Inform Process Lett."},{"key":"10.1016\/S0166-218X(96)00072-8_BIB13","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1137\/0209042","article-title":"Generating all maximal independent sets: NP-hardness and polynomial-time algorithms","volume":"9","author":"Lawler","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(96)00072-8_BIB14","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1126\/science.8211139","article-title":"Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment","volume":"262","author":"Lawrence","year":"1993","journal-title":"Science"},{"key":"10.1016\/S0166-218X(96)00072-8_BIB15","first-page":"169","article-title":"Building multiple alignments from pairwise alignments","volume":"9","author":"Miller","year":"1993","journal-title":"CABIOS"},{"key":"10.1016\/S0166-218X(96)00072-8_BIB16","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1089\/cmb.1994.1.51","article-title":"Constructing aligned sequence blocks","volume":"1","author":"Miller","year":"1994","journal-title":"J. Computat. Biol."},{"key":"10.1016\/S0166-218X(96)00072-8_BIB17","series-title":"Proceedings of the 6 th Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"38","article-title":"Chaining multiple-alignment fragments in sub-quadratic time","author":"Myers","year":"1995"},{"key":"10.1016\/S0166-218X(96)00072-8_BIB18","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1006\/jmbi.1994.1407","article-title":"Detecting patterns in protein sequences","volume":"239","author":"Neuwald","year":"1994","journal-title":"J. Mol. Biol."},{"key":"10.1016\/S0166-218X(96)00072-8_BIB19","first-page":"537","article-title":"VISA: visual sequence analysis for the comparison of multiple amino acid sequences","volume":"10","author":"P\u00f3sfai","year":"1994","journal-title":"CABIOS"},{"key":"10.1016\/S0166-218X(96)00072-8_BIB20","first-page":"180","article-title":"A workbench for multiple alignment construction and analysis, Proteins: Struct.","volume":"9","author":"Schuler","year":"1991","journal-title":"Fuct. Gene."},{"key":"10.1016\/S0166-218X(96)00072-8_BIB21","doi-asserted-by":"crossref","first-page":"4663","DOI":"10.1093\/nar\/19.17.4663","article-title":"Software tools for analyzing pairwise sequence alignments","volume":"19","author":"Schwartz","year":"1991","journal-title":"Nucleic Acid Res."},{"key":"10.1016\/S0166-218X(96)00072-8_BIB22","doi-asserted-by":"crossref","first-page":"4673","DOI":"10.1093\/nar\/22.22.4673","article-title":"CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice","volume":"22","author":"Thompson","year":"1994","journal-title":"Nucleic Acids Res."},{"key":"10.1016\/S0166-218X(96)00072-8_BIB23","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","article-title":"A new algorithm for generating all the maximal independent sets","volume":"6","author":"Tsukiyama","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(96)00072-8_BIB24","first-page":"89","article-title":"An algorithm for simultaneous comparison of several sequences","volume":"4","author":"Vihinen","year":"1988","journal-title":"CABIOS"},{"key":"10.1016\/S0166-218X(96)00072-8_BIB25","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0022-2836(91)90871-3","article-title":"Motif recognition and alignment for many sequences by comparison of dot-matrices","volume":"218","author":"Vingron","year":"1991","journal-title":"J. Mol. Biol."},{"key":"10.1016\/S0166-218X(96)00072-8_BIB26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/aama.1995.1001","article-title":"Multiple sequence comparison and consistency on multipartite graphs","volume":"16","author":"Vingron","year":"1995","journal-title":"Adv. Appl. Math."},{"key":"10.1016\/S0166-218X(96)00072-8_BIB27","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. Computat. Biol."},{"key":"10.1016\/S0166-218X(96)00072-8_BIB28","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1089\/cmb.1994.1.217","article-title":"Chaining multiple-alignment blocks","volume":"1","author":"Zhang","year":"1994","journal-title":"J. Computat. Biol."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000728?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000728?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T16:48:26Z","timestamp":1579020506000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000728"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":28,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S0166218X96000728"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00072-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}