Sciweavers

2192 search results - page 34 / 439
» Algorithms for Challenging Motif Problems
Sort
View
KDD
2002
ACM
125views Data Mining» more  KDD 2002»
14 years 8 months ago
Pattern discovery in sequences under a Markov assumption
In this paper we investigate the general problem of discovering recurrent patterns that are embedded in categorical sequences. An important real-world problem of this nature is mo...
Darya Chudova, Padhraic Smyth
CONSTRAINTS
2008
95views more  CONSTRAINTS 2008»
13 years 8 months ago
Efficient Sequence Alignment with Side-Constraints by Cluster Tree Elimination
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
Sebastian Will, Anke Busch, Rolf Backofen
RECOMB
2005
Springer
14 years 8 months ago
Segmentation Conditional Random Fields (SCRFs): A New Approach for Protein Fold Recognition
Abstract. Protein fold recognition is an important step towards understanding protein three-dimensional structures and their functions. A conditional graphical model, i.e. segmenta...
Yan Liu, Jaime G. Carbonell, Peter Weigele, Vanath...
TON
2012
11 years 10 months ago
Power Control for Cognitive Radio Networks: Axioms, Algorithms, and Analysis
—The deployment of cognitive radio networks enables efficient spectrum sharing and opportunistic spectrum access. It also presents new challenges to the classical problem of int...
Siamak Sorooshyari, Chee Wei Tan, Mung Chiang
DFG
2009
Springer
14 years 2 months ago
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Abstract. We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed, Smith, and Vetta. This technique has proven...
Jiong Guo, Hannes Moser, Rolf Niedermeier