论文信息 - Finding All Common Intervals of k Permutations

Finding All Common Intervals of k 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 present an algorithm that finds in a family of k permutations of n elements all K common intervals in optimal O(nk+K) time and O(n) additional space.This extends a result by Uno and Yagiura (Algorithmica 26, 290-309, 2000) who present an algorithm to find all K common intervals of k = 2 permutations in optimal O(n+K) time and O(n) space. To achieve our result, we introduce the set of irreducible intervals, a generating subset of the set of all common intervals of k permutations.

Jens Stoye | Steffen Heber | J. Stoye | S. Heber

[1] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[2] R. Overbeek,et al. The use of gene clusters to infer functional coupling. , 1999, Proceedings of the National Academy of Sciences of the United States of America.

[3] Isao Ono,et al. An Efficient Genetic Algorithm for Job Shop Scheduling Problems , 1995, International Conference on Genetic Algorithms.

[4] B. Snel,et al. STRING: a web-server to retrieve and display the repeatedly occurring neighbourhood of a gene. , 2000, Nucleic acids research.

[5] D. Eisenberg,et al. Detecting protein function and protein-protein interactions from genome sequences. , 1999, Science.

[6] Heinz Mühlenbein,et al. Evolution algorithms in combinatorial optimization , 1988, Parallel Comput..

[7] R. Brady. Optimization strategies gleaned from biological evolution , 1985, Nature.

[8] D. R. Fulkerson,et al. Incidence matrices with the consecutive 1's property , 1964 .

[9] Takeaki Uno,et al. Fast Algorithms to Enumerate All Common Intervals of Two Permutations , 1997, Algorithmica.

[10] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .