Algorithms for Finding Gene Clusters
- 17 August 2001
- book chapter
- Published by Springer Nature
- p. 252-263
- https://doi.org/10.1007/3-540-44696-6_20
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Finding All Common Intervals of k PermutationsPublished by Springer Nature ,2001
- Horizontal gene transfer among microbial genomes: new insights from complete genome analysisCurrent Opinion in Genetics & Development, 2000
- Automatic detection of conserved gene clusters in multiple genomes by graph comparison and P-quasi groupingNucleic Acids Research, 2000
- Transforming cabbage into turnipJournal of the ACM, 1999
- Conservation of gene order: a fingerprint of proteins that physically interactPublished by Elsevier ,1998
- Measuring genome evolutionProceedings of the National Academy of Sciences, 1998
- Genome Rearrangements and Sorting by ReversalsSIAM Journal on Computing, 1996
- 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