On the Similarity of Sets of Permutations and Its Applications to Genome Comparison-Reference-Cited by-同舟云学术

On the Similarity of Sets of Permutations and Its Applications to Genome Comparison

Published:2003 Issue: Volume: Page:68-79
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bergeron Anne,Stoye Jens

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45071-8_9

Reference22 articles.

1. Lect Notes Comput Sci;Y. Ajana,2002

2. D. A. Bader, B. M. E. Moret, and M. Yan. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. J. Comp. Biol., 8(5):483–492, 2001.

3. V. Bafna and P. A. Pevzner. Sorting by transpositions. SIAM J. Disc. Math., 11(2):224–240, 1998.

4. A. Bergeron, S. Heber, and J. Stoye. Common intervals and sorting by reversals: A marriage of necessity. Bioinformatics, 18(Suppl. 2):S54–S63, 2002. (Proc. ECCB 2002).

5. A. Bergeron and J. Stoye. On the similarity of sets of permutations and its application to genome comparison. Report 2003-01, Technische Fakultät der Universität Bielefeld, 2003. (Available at www.techfak.uni-bielefeld.de/stoye/rpublications/report2003-01.pdf).

Cited by 35 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Retrospective on Genomic Preprocessing for Comparative Genomics;Models and Algorithms for Genome Evolution;2013

2. Computing the Summed Adjacency Disruption Number between Two Genomes with Duplicate Genes;Journal of Computational Biology;2010-09

3. Chromosomal Rearrangements in Evolution;Evolutionary Genomics and Systems Biology;2010-07-12

4. Sorting Signed Permutations by Inversions in O(nlogn) Time;Journal of Computational Biology;2010-03

5. Hurdles and Sorting by Inversions: Combinatorial, Statistical, and Experimental Results;Journal of Computational Biology;2009-10