Sciweavers

28 search results - page 4 / 6
» Genome Rearrangement: A Planning Approach
Sort
View
BIOCOMP
2007
13 years 8 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
CSB
2005
IEEE
182views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Bacterial Whole Genome Phylogeny Using Proteome Comparison and Optimal Reversal Distance
Traditional phylogenetic tree reconstruction is based on point mutations of a single gene. This approach is hardly suitable for genomes whose genes are almost identical and hardly...
Noppadon Khiripet
CIBCB
2005
IEEE
14 years 1 months ago
Heuristic Algorithm for Computing Reversal Distance with MultiGene Families via Binary Integer Programming
— Hannenhalli and Pevzner developed the first polynomial-time algorithm for the combinatorial problem of sorting of signed genomic data. Their algorithm solves the minimum numbe...
Jakkarin Suksawatchon, Chidchanok Lursinsap, Mikae...
BIBE
2007
IEEE
127views Bioinformatics» more  BIBE 2007»
14 years 1 months ago
A Heuristic for Phylogenetic Reconstruction Using Transposition
Abstract—Because of the advent of high-throughput sequencing and the consequent reduction in cost of sequencing, many organisms have been completely sequenced and most of their g...
Feng Yue, Meng Zhang, Jijun Tang
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