Sciweavers

158 search results - page 8 / 32
» Parallel Biological Sequence Comparison Using Prefix Computa...
Sort
View
BMCBI
2010
189views more  BMCBI 2010»
13 years 7 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
BMCBI
2010
198views more  BMCBI 2010»
13 years 7 months ago
ClustalXeed: a GUI-based grid computation version for high performance and terabyte size multiple sequence alignment
Background: There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited...
Taeho Kim, Hyun Joo
BIOCOMP
2006
13 years 8 months ago
PAC: Progressive Alignment with Consensus Sequences
Computation of multiple sequence alignments is one of the major open problems in computational molecular biology. The purpose of this study was to provide a new method, PAC (Progre...
Ke Liu, Mansur H. Samadzadeh
ISMB
1997
13 years 8 months ago
Identifying Chimerism in Proteins Using Hidden Markov Models of Codon Usage
Protein chimerism is a phenomenon involving the combination of multiple ancestral sequences into a single, multi-domain protein through evolution. We propose a novel method for de...
Lawrence Hunter, Barry Zeeberg
RECOMB
2004
Springer
14 years 7 months ago
Chromosomal breakpoint re-use in the inference of genome sequence rearrangement
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
David Sankoff, Phil Trinh