Sciweavers

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

8

COCOON
2005
Springer

favoriteEmaildiscussreport

100views Combinatorics» more COCOON 2005»

Conserved Interval Distance Computation Between Non-trivial Genomes

13 years 10 months ago

Conserved Interval Distance Computation Between Non-trivial Genomes

Download igm.univ-mlv.fr

Recently, several studies taking into account the ability for a gene to be absent or to have some copies in genomes have been proposed, as the examplar distance [11, 6] or the gene matching computation between two genomes [10, 3]. In this paper, we study the time complexity of the conserved interval distance computation considering duplicated genes using both those two strategies.

Guillaume Blin, Romeo Rizzi

Real-time Traffic

COCOON 2005 | Gene Matching Computation | Genomes | Interval Distance Computation |

claim paper

Related Content

» On the inapproximability of the exemplar conserved interval distance problem of genomes

» Inferring Positional Homologs with Common Intervals of Sequences

» Fast estimation of the difference between two PAMJTT evolutionary distances in triplets of...

» Perfect Sorting by Reversals Is Not Always Difficult

» Cinteny flexible analysis and visualization of synteny and genome rearrangements in multip...

» The Average Mutual Information Profile as a Genomic Signature

» Genomes are covered with ubiquitous 11 bp periodic patterns the class A flexible patterns

» CpGcluster a distancebased algorithm for CpGisland detection

» VITCOMIC visualization tool for taxonomic compositions of microbial communities based on 1...

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	COCOON
Authors	Guillaume Blin, Romeo Rizzi

Comments (0)