Sciweavers

Share
WABI
2001
Springer

Algorithms for Finding Gene Clusters

9 years 4 months ago
Algorithms for Finding Gene Clusters
Abstract. Comparing gene orders in completely sequenced genomes is a standard approach to locate clusters of functionally associated genes. Often, gene orders are modeled as permutations. Given k permutations of n elements, a k-tuple of intervals of these permutations consisting of the same set of elements is called a common interval. We consider several problems related to common intervals in multiple genomes. We present an algorithm that finds all common intervals in a family of genomes, each of which might consist of several chromosomes. We present another algorithm that finds all common intervals in a family of circular permutations. A third algorithm finds all common intervals in signed permutations. We also investigate how to combine these approaches. All algorithms have optimal worst-case time complexity and use linear space.
Steffen Heber, Jens Stoye
Added 30 Jul 2010
Updated 30 Jul 2010
Type Conference
Year 2001
Where WABI
Authors Steffen Heber, Jens Stoye
Comments (0)
books