Sciweavers

1732 search results - page 195 / 347
» Sequences of Level 1, 2, 3, ..., k , ..
Sort
View
BMCBI
2007
142views more  BMCBI 2007»
15 years 6 months ago
Improving model construction of profile HMMs for remote homology detection through structural alignment
Background: Remote homology detection is a challenging problem in Bioinformatics. Arguably, profile Hidden Markov Models (pHMMs) are one of the most successful approaches in addre...
Juliana S. Bernardes, Alberto M. R. Dávila,...
BMCBI
2004
158views more  BMCBI 2004»
15 years 6 months ago
Improvement of alignment accuracy utilizing sequentially conserved motifs
Background: Multiple sequence alignment algorithms are very important tools in molecular biology today. Accurate alignment of proteins is central to several areas such as homology...
Saikat Chakrabarti, Nitin Bhardwaj, Prem A. Anand,...
WADS
2001
Springer
63views Algorithms» more  WADS 2001»
15 years 11 months ago
When Can You Fold a Map?
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequenc...
Esther M. Arkin, Michael A. Bender, Erik D. Demain...
SODA
2010
ACM
371views Algorithms» more  SODA 2010»
16 years 3 months ago
Online Learning with Queries
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
Chao-Kai Chiang, Chi-Jen Lu
COMPGEOM
2007
ACM
15 years 10 months ago
Kinetic KD-trees and longest-side KD-trees
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
Mohammad Ali Abam, Mark de Berg, Bettina Speckmann