Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

JCB
2007

favoriteEmaildiscussreport

58views more JCB 2007»

Gene Maps Linearization Using Genomic Rearrangement Distances

13 years 4 months ago

Gene Maps Linearization Using Genomic Rearrangement Distances

Download igm.univ-mlv.fr

Guillaume Blin, Eric Blais, Danny Hermelin, Pierre

Real-time Traffic

JCB 2007 |

claim paper

Related Content

» A linear time algorithm for the inversion median problem in circular bacterial genomes

» MultiBreak Rearrangements and Breakpoint ReUses From Circular to Linear Genomes

» Multibreak Rearrangements From Circular to Linear Genomes

» Inferring Gene Orders from Gene Maps Using the Breakpoint Distance

» A New Genomic Evolutionary Model for Rearrangements Duplications and Losses That Applies a...

» Estimating true evolutionary distances under rearrangements duplications and losses

» A Lower Bound for the Breakpoint Phylogeny Problem

» Algorithms for sorting unsigned linear genomes by the DCJ operations

» Bacterial Whole Genome Phylogeny Using Proteome Comparison and Optimal Reversal Distance

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JCB
Authors	Guillaume Blin, Eric Blais, Danny Hermelin, Pierre Guillon, Mathieu Blanchette, Nadia El-Mabrouk

Comments (0)