Efficient algorithms for consensus string problems minimizing both distance sum and radius

- Title
- Efficient algorithms for consensus string problems minimizing both distance sum and radius

- Author
- 박희진

- Keywords
- Consensus strings; Multiple alignments; Distance sum; Radius

- Issue Date
- 2011-09

- Publisher
- ELSEVIER SCIENCE BV, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS

- Citation
- In Theoretical Computer Science, Vol.415, N0.39, p5239-5246

- Abstract
- The consensus (string) problem is finding a representative string, called a consensus, of a given set S of strings. In this paper we deal with consensus problems considering both distance sum and radius, where the distance sum is the sum of (Hamming) distances from the strings in S to the consensus and the radius is the longest (Hamming) distance from the strings in S to the consensus. Although there have been results considering either distance sum or radius, there have been no results considering both, to the best of our knowledge.We present the first algorithms for two consensus problems considering both distance sum and radius for three strings: one problem is to find an optimal consensus minimizing both distance sum and radius. The other problem is to find a bounded consensus such that the distance sum is at most s and the radius is at most r for given constants s and r. Our algorithms are based on characterization of the lower bounds of distance sum and radius, and thus they solve the problems efficiently. Both algorithms run in linear time. (C) 2011 Elsevier B.V. All rights reserved.

- URI
- http://www.sciencedirect.com/science/article/pii/S0304397511004439?via%3Dihubhttp://hdl.handle.net/20.500.11754/36653

- ISSN
- 0304-3975

- Appears in Collections:
- COLLEGE OF ENGINEERING[S](공과대학) > COMPUTER SCIENCE AND ENGINEERING(컴퓨터공학부) > Articles

- Files in This Item:

There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.