Back
Computing measures between two genomes
This is a join work with S. Angibaud, G. Fertin, I. Rusu form university of Nantes and S. Vialette from university of Paris Est. You can refer to [1] and [2] for more details. WithDuplication.xls (503KB)
Adj1PO.xls (87KB)
Adj2PO.xls (328KB)
IC1PO.xls (80KB)
[2] S. Angibaud , G. Fertin , A. Thevenin , S. Vialette. Pseudo Boolean Programming for Partially Ordered Genomes. RecombCG, 2009.
Preliminaries
Some results
References
This is a join work with S. Angibaud, G. Fertin, I. Rusu form university of Nantes and S. Vialette from university of Paris Est. You can refer to [1] and [2] for more details. WithDuplication.xls (503KB)
Adj1PO.xls (87KB)
Adj2PO.xls (328KB)
IC1PO.xls (80KB)
Last modification: 08/31/2009
[1] S. Angibaud , G. Fertin , I. Rusu , A. Thevenin , S. Vialette. Efficient tools for computing the number of breakpoints and the number of adjacencies between two genomes with duplicate gene. In Journal of Computational Biology, volume 15, 2008.[2] S. Angibaud , G. Fertin , A. Thevenin , S. Vialette. Pseudo Boolean Programming for Partially Ordered Genomes. RecombCG, 2009.