Finding all common intervals of k permutations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2089, Issue , 2001, Pages 207-218

  Heber, Steffen ^a,b   Stoye, Jens ^a,c  

^a GERMAN CANCER RESEARCH CENTER DKFZ   (Germany)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MAX PLANCK INSTITUTE FOR MOLECULAR GENETICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMMON INTERVALS; K PERMUTATIONS;

PATTERN MATCHING;

EID: 84956972433     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48194-x_19     Document Type: Conference Paper

References (10)

1. K.S. Booth and G.S. Lueker. Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci., 13(3):335-379, 1976.
2. R.M. Brady. Optimization strategies gleaned from biological evolution. Nature, 317:804-806, 1985.
3. D. Fulkerson and O. Gross. Incidence matrices with the consecutive 1s property. Bull. Am. Math. Soc., 70:681-684, 1964.
4. M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
5. S. Kobayashi, I. Ono, and M. Yamamura. An eficient genetic algorithm for job shop scheduling problems. In Proc. of the 6th International Conference on Genetic Algorithms, pages 506-511. Morgan Kaufmann, 1995.
6. E.M. Marcotte, M. Pellegrini, H.L. Ng, D.W. Rice, T.O. Yeates, and D. Eisenberg. Detecting protein function and protein-protein interactions from genome sequences. Science, 285:751-753, 1999.
7. H. Mühlenbein, M. Gorges-Schleuter, and O. Krämer. Evolution algorithms in combinatorial optimization. Parallel Comput., 7:65-85, 1988.
8. R. Overbeek, M. Fonstein, M. D'Souza, G.D. Pusch, and N. Maltsev. The use of gene clusters to infer functional coupling. Proc. Natl. Acad. Sci. USA, 96(6):2896-2901, 1999.
9. B. Snel, G. Lehmann, P. Bork, and M.A. Huynen. STRING: A web-server to retrieve and display the repeatedly occurring neigbourhood of a gene. Nucleic Acids Res., 28(18):3443-3444, 2000.
10. T. Uno and M. Yagiura. Fast algorithms to enumerate all common intervals of two permutations. Algorithmica, 26(2):290-309, 2000.