{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:55:14Z","timestamp":1729641314400,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/tai.2003.1250221","type":"proceedings-article","created":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T21:26:50Z","timestamp":1078176410000},"page":"427-434","source":"Crossref","is-referenced-by-count":7,"title":["Sweep A: space-efficient heuristic search in partially ordered graphs"],"prefix":"10.1109","author":[{"family":"Rong Zhou","sequence":"first","affiliation":[]},{"given":"E.A.","family":"Hansen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1089\/106652701446134"},{"key":"ref11","first-page":"737","article-title":"Memory-efficient A* heuristics for multiple sequence alignment","author":"mcnaughton","year":"2002","journal-title":"Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-02)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/4.1.11"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/3468.477872"},{"key":"ref14","first-page":"923","article-title":"A* with partial expansion for large branching factor problems","author":"yoshizumi","year":"2000","journal-title":"Proceedings of the 17th National Conference on Artificial Intelli-Renee (AAAI-2000)"},{"key":"ref15","first-page":"975","article-title":"Multiple sequence alignment using Anytime A*","author":"zhou","year":"2002","journal-title":"Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-02)"},{"key":"ref16","first-page":"1259","article-title":"Sparse-memory graph search","author":"zhou","year":"2001","journal-title":"Proceedings of the 17th International Joint Conference on Artificial Intelligence (IICAI-2003)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00093-0"},{"key":"ref3","first-page":"1239","article-title":"Comparing best-first search and dynamic programming for optimal multiple sequence alignment","author":"hohwald","year":"2003","journal-title":"Proceedings of the 18th International Joint Conference on Artificial Intelligence (IICAI-2003)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(90)90054-4"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","article-title":"Depth-first iterative deepening: An optimal admissible tree search","volume":"27","author":"korf","year":"1985","journal-title":"Artificial Intelligence"},{"key":"ref8","first-page":"1184","article-title":"Divide-and-conquer bidirectional search: First re-sults","author":"korf","year":"1999","journal-title":"Proceedings of the 16th International Joint Conference on Artifiicial Intelligence (IICAI-99)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(93)90045-D"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360861"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0148063"},{"key":"ref9","first-page":"910","article-title":"Divide-and-conquer frontier search applied to optimal sequence alignment","author":"korf","year":"2000","journal-title":"Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-2000)"}],"event":{"name":"15th IEEE International Conference on Tools with Artificial Intelligence","acronym":"TAI-03","location":"Sacramento, CA, USA"},"container-title":["Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8840\/27974\/01250221.pdf?arnumber=1250221","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T00:05:49Z","timestamp":1497571549000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1250221\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/tai.2003.1250221","relation":{},"subject":[]}}