Sciweavers

240 search results - page 11 / 48
» Comparing Sequences with Segment Rearrangements
Sort
View
WABI
2010
Springer
160views Bioinformatics» more  WABI 2010»
13 years 5 months ago
Genomic Distance with DCJ and Indels
The double cut and join (DCJ) operation, introduced by Yancopoulos, Attie and Friedberg in 2005, allows one to represent most rearrangement events in genomes. However, a DCJ cannot...
Marília D. V. Braga, Eyla Willing, Jens Sto...
BIOCOMP
2007
13 years 9 months ago
Towards Phylogenomic Reconstruction
Reconstructing phylogenies is one of the primary objectives in evolution studies. Efficient software to reconstruct phylogenies based on isolated genes has existed for decades, ye...
Le Vinh, Andres Varon, Daniel Janies, Ward Wheeler
RECOMB
2001
Springer
14 years 7 months ago
A new approach to sequence comparison: normalized sequence alignment
The Smith-Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach w...
Abdullah N. Arslan, Ömer Egecioglu, Pavel A. ...
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
13 years 11 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
BMCBI
2010
96views more  BMCBI 2010»
13 years 7 months ago
ModuleOrganizer: detecting modules in families of transposable elements
Background: Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority of the genome seque...
Sébastien Tempel, Christine Rousseau, Fariz...