The complexity of gene placement

Authors:
Leslie Ann Goldberg;Paul W. Goldberg;Mike Paterson;Pavel Pevzner;Süleyman Cenk Sahinalp;Elizabeth Sweedyk
Affiliations:
Dept. of Computer Science, Univ. of Warwick, Coventry, CV4 7AL, UK;-;Dept. of Computer Science, Univ. of Warwick, Coventry, CV4 7AL, UK;Department of Computer Science, U.S.C., CA;Dept. of Computer Science, Univ. of Warwick, Coventry, CV4 7AL, UK and Center for BioInformatics, University of Pennsylvania, PA;DIMACS, Rutgers University, NJ
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Citing 6
Cited 1

Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Of mice and men: algorithms for evolutionary distances between genomes with translocation

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
To cut…or not to cut (applications of comparative physical maps in molecular evolution)

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Genome Rearrangements and Sorting by Reversals

SIAM Journal on Computing
Efficient Bounds for Oriented Chromosome Inversion Distance

CPM '94 Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching
Transforming men into mice (polynomial algorithm for genomic distance problem)

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

Permutation Editing and Matching via Embeddings

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,

Quantified Score

Hi-index	0.00

Visualization

Abstract