{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T15:53:57Z","timestamp":1762444437077},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/tkde.2014.2304464","type":"journal-article","created":{"date-parts":[[2014,2,4]],"date-time":"2014-02-04T19:03:45Z","timestamp":1391540625000},"page":"2599-2609","source":"Crossref","is-referenced-by-count":24,"title":["A Space-Bounded Anytime Algorithm for the Multiple Longest Common Subsequence Problem"],"prefix":"10.1109","volume":"26","author":[{"given":"Jiaoyun","family":"Yang","sequence":"first","affiliation":[]},{"given":"Yun","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Shang","sequence":"additional","affiliation":[]},{"given":"Guoliang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2003.1250221"},{"key":"ref38","first-page":"1259","article-title":"Sparse-Memory Graph Search","author":"zhou","year":"2003","journal-title":"Proc 18th Int?l Joint Conf Artificial Intelligence (IJCAI ?03)"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74446-7_11"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.02.005"},{"key":"ref31","article-title":"ITSA*: Iterative Tunneling Search with A*","author":"furcy","year":"2006","journal-title":"Proc Nat?l Conf Artificial Intelligence (AAAI) Workshop Heuristic Search Memory-Based Heuristics and Their Applications"},{"key":"ref30","first-page":"90","article-title":"Beam-Stack Search: Integrating Backtracking with Beam Search","author":"zhou","year":"2005","journal-title":"Proc of the Int Conf on Automated Planning and Scheduling (ICAPS)"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1089023.1089024"},{"key":"ref36","first-page":"910","article-title":"Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment","author":"korf","year":"2000","journal-title":"Proc 17th Nat?l Conf Artificial Intelligence (AAAI ?00)"},{"key":"ref35","first-page":"1184","article-title":"Divide-and-Conquer Bidirectional Search: First Results","author":"korf","year":"1999","journal-title":"Proc 16th Int?l Joint Conf Artificial Intelligence (IJCAI ?99)"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"1287","DOI":"10.1609\/aaai.v24i1.7493","article-title":"A Fast Heuristic Search Algorithm for Finding the Longest Common Subsequence of Multiple Strings","author":"wang","year":"2010","journal-title":"Proc 24th AAAI Conf Artificial Intelligence"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1080\/10556789808805713"},{"key":"ref40","first-page":"92","article-title":"Breadth-First Heuristic Search","author":"zhou","year":"2004","journal-title":"Proc 14th Int?l Conf Automated Planning and Scheduling (ICAPS ?04)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth1156"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.69.1.4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934514"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/322033.322044"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(92)90132-Y","article-title":"Fast Linear-Space Computations of Longest Common Subsequences","volume":"92","author":"apostolico","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90002-1"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/B978-155860869-6\/50032-9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1061318.1061320"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.123"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/protein\/7.2.195"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2010.2089619"},{"key":"ref3","author":"sankoff","year":"1983","journal-title":"Time Warps String Edits and Macromolecules The Theory and Practice of Sequence Comparison"},{"key":"ref27","first-page":"2250","article-title":"AWA*-A Window Constrained Anytime Heuristic Search Algorithm","author":"aine","year":"2007","journal-title":"Proc Int?l Joint Conf Artificial Intelligence"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/322063.322075"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(81)90087-5"},{"key":"ref29","first-page":"425","article-title":"Complete Anytime Beam Search","author":"zhang","year":"1998","journal-title":"Proc Nat?l Conf Artificial Intelligence"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SPIRE.2000.878178"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51465-1_6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1978.4309979"},{"key":"ref1","author":"hunt","year":"1975","journal-title":"An Algorithm for Differential File Comparison"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/10556789808805713"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-S4-S4"},{"key":"ref45","first-page":"203","article-title":"Memory-Bounded A. Graph Search","author":"zhou","year":"2002","journal-title":"Proc Int Florida Artif Intell Res Soc Conf"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.202"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.79"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(89)90010-6"},{"key":"ref24","article-title":"ARA*: Anytime A* with Provable Bounds on Sub-Optimality","volume":"16","author":"likhachev","year":"2003","journal-title":"Proc Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2005.12.002"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2096","article-title":"Anytime Heuristic Search","volume":"28","author":"hansen","year":"2007","journal-title":"J Artificial Intelligence Research"},{"key":"ref44","first-page":"1359","article-title":"Memory-Bounded Bidirectional Search","volume":"2","author":"kaindl","year":"1994","journal-title":"Proc 10th Nat?l Conf Artificial Intelligence"},{"key":"ref26","article-title":"ANA*: Anytime Nonparametric A","author":"berg","year":"2011","journal-title":"Proc AAAI Conf Artificial Intelligence"},{"key":"ref43","first-page":"1","article-title":"Efficient Memory-Bounded Search Methods","author":"russell","year":"1992","journal-title":"Proc 10th European Conf Artificial Intelligence (ECAI 92)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2007.11.009"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/6915958\/06731533.pdf?arnumber=6731533","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T07:07:37Z","timestamp":1688972857000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6731533\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":45,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2014.2304464","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2014,11]]}}}