{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T12:12:36Z","timestamp":1648815156680},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1996,3]]},"abstract":"<jats:p> An alignment of k given sequences is a k-rowed matrix frequently used by molecular biologists to display correspondences between entries from each sequence. Under one approach, an alignment is represented by a matrix of \u2018x\u2019 and \u2019-\u2019 characters, where each x in row r indicates the position of an entry of sequence r. It is sometimes efficient to store only the run-length encoding of each row of this bit-matrix. A natural class of commands for editing one such row into another consists of operations of the form: \u201cMove the d dashes that begin at position i of row r to position j of that row,\u201d for relevant values of r, d, i and j. We show that the problem of determining a shortest sequence of such operations that converts one given alignment to another is NP-hard and give a polynomial-time algorithm that always comes within a factor 5\/4 of optimality. An application of these ideas to alignments of long DNA sequences is discussed. <\/jats:p>","DOI":"10.1142\/s012905419600004x","type":"journal-article","created":{"date-parts":[[2004,9,6]],"date-time":"2004-09-06T11:50:09Z","timestamp":1094471409000},"page":"23-41","source":"Crossref","is-referenced-by-count":0,"title":["ALIGNMENT-TO-ALIGNMENT EDITING WITH \u201cMOVE GAP\u201d OPERATIONS"],"prefix":"10.1142","volume":"07","author":[{"given":"MARTIN","family":"F\u00dcRER","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA 16802, USA"}]},{"given":"WEBB","family":"MILLER","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, The Pennsylvania State University, University Park, PA 16802, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905419600004X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:43:09Z","timestamp":1565138589000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905419600004X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":0,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1996,3]]}},"alternative-id":["10.1142\/S012905419600004X"],"URL":"https:\/\/doi.org\/10.1142\/s012905419600004x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}