{"type":"ScholarlyArticle","title":"Comparing Best-First Search and Dynamic Programming for Optimal Multiple Sequence Alignment","authors":[{"name":"Heath Hohwald","slug":"heath-hohwald","given":"Heath","family":"Hohwald","affiliation":""},{"name":"Ignacio Thayer","slug":"ignacio-thayer","given":"Ignacio","family":"Thayer","affiliation":""},{"name":"Richard E. Korf","slug":"richard-e-korf","given":"Richard E.","family":"Korf","affiliation":""}],"abstract":"Sequence alignment is an important problem in computational biology. We compare two different approaches to the problem of optimally aligning two or more character strings: bounded dynamic programming (BDP), and divide-and-conquer frontier search (DCFS). The approaches are compared in terms of time and space requirements in 2 through 5 dimensions with sequences of varying similarity and length. While BDP performs better in two and three dimensions, it consumes more time a nd memory than DCFS for higher-dimensional problems.","doi":null,"url":"https://ijcai.org/proceedings/2003/176","pdf":"https://ijcai.org/proceedings/2003/0176.pdf","markdown":"https://ijcai.org/proceedings/2003/176.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/176","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":176,"pages":{"first":1239,"last":1244},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}