Finding All Common Intervals of k Permutations
- 13 June 2001
- book chapter
- Published by Springer Nature
- p. 207-218
- https://doi.org/10.1007/3-540-48194-x_19
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- STRING: a web-server to retrieve and display the repeatedly occurring neighbourhood of a geneNucleic Acids Research, 2000
- Fast Algorithms to Enumerate All Common Intervals of Two PermutationsAlgorithmica, 2000
- Detecting Protein Function and Protein-Protein Interactions from Genome SequencesScience, 1999
- The use of gene clusters to infer functional couplingProceedings of the National Academy of Sciences, 1999
- Evolution algorithms in combinatorial optimizationParallel Computing, 1988
- Optimization strategies gleaned from biological evolutionNature, 1985
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Incidence matrices with the consecutive 1’s propertyBulletin of the American Mathematical Society, 1964