Author:
Delgado João,Lynce Inês,Manquinho Vasco
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Angibaud, S., Fertin, G., Rusu, I., Thévenin, A., Vialette, S.: Efficient tools for computing the number of breakpoints and the number of adjacencies between two genomes with duplicate genes. Journal of Computational Biology 15(8), 1093–1115 (2008)
2. Angibaud, S., Fertin, G., Rusu, I., Vialette, S.: A general framework for computing rearrangement distances between genomes with duplicates. Journal of Computational Biology 14(4), 379–393 (2007)
3. Bafna, V., Pevzner, P.A.: Sorting by reversals: Genome rearrangements in plant organneles and evolutionary history of x chromosome. Molecular Biology and Evolution 12(2), 239–246 (1995)
4. Bafna, V., Pevzner, P.A.: Genome rearrangements and sorting by reversals. SIAM Journal on Computing 25(2), 272–289 (1996)
5. Barth, P.: A Davis-Putnam enumeration algorithm for linear pseudo-Boolean optimization. Technical Report MPI-I-95-2-003, Max Plank Institute for CS (1995)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献