Sciweavers

159 search results - page 18 / 32
» Ensembl Genomes 2016: more genomes, more complexity
Sort
View
BMCBI
2005
87views more  BMCBI 2005»
14 years 10 months ago
Efficient decoding algorithms for generalized hidden Markov model gene finders
Background: The Generalized Hidden Markov Model (GHMM) has proven a useful framework for the task of computational gene prediction in eukaryotic genomes, due to its flexibility an...
William H. Majoros, Mihaela Pertea, Arthur L. Delc...
BMCBI
2005
158views more  BMCBI 2005»
14 years 10 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
WABI
2009
Springer
130views Bioinformatics» more  WABI 2009»
15 years 5 months ago
Linear-Time Protein 3-D Structure Searching with Insertions and Deletions
It becomes more and more important to search for similar structures from molecular 3-D structure databases in the structural biology of the post genomic era. Two molecules are said...
Tetsuo Shibuya, Jesper Jansson, Kunihiko Sadakane
ICPP
2007
IEEE
15 years 4 months ago
Efficient Parallel Algorithm for Optimal Three-Sequences Alignment
Sequence alignment is a fundamental problem in the computational biology. Many alignment methods have been proposed in the literature, such as pair-wise sequence alignment (2SA), ...
Chun-Yuan Lin, Chen Tai Huang, Yeh-Ching Chung, Ch...
BMCBI
2006
104views more  BMCBI 2006»
14 years 10 months ago
SinicView: A visualization environment for comparisons of multiple nucleotide sequence alignment tools
Background: Deluged by the rate and complexity of completed genomic sequences, the need to align longer sequences becomes more urgent, and many more tools have thus been developed...
Arthur Chun-Chieh Shih, D. T. Lee, Laurent Lin, Ch...