Sciweavers

697 search results - page 20 / 140
» Improving EAs for Sequencing Problems
Sort
View
RECOMB
2004
Springer
14 years 8 months ago
Multiple organism gene finding by collapsed gibbs sampling
The Gibbs sampling method has been widely used for sequence analysis after it was successfully applied to the problem of identifying regulatory motif sequences upstream of genes. ...
Sourav Chatterji, Lior Pachter
WABI
2005
Springer
117views Bioinformatics» more  WABI 2005»
14 years 1 months ago
Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons
Multiple Sequence Alignment (MSA) is one of the most fundamental problems in computational molecular biology. The running time of the best known scheme for finding an optimal ali...
Pankaj K. Agarwal, Yonatan Bilu, Rachel Kolodny
BMCBI
2006
136views more  BMCBI 2006»
13 years 8 months ago
EMD: an ensemble algorithm for discovering regulatory motifs in DNA sequences
Background: Understanding gene regulatory networks has become one of the central research problems in bioinformatics. More than thirty algorithms have been proposed to identify DN...
Jianjun Hu, Yifeng D. Yang, Daisuke Kihara
BIOINFORMATICS
2010
87views more  BIOINFORMATICS 2010»
13 years 8 months ago
Improving protein secondary structure prediction using a simple k-mer model
Motivation: Existing methods for protein sequence analysis are generally firstorder and inherently assume that each position is independent. We develop a general framework for int...
Martin Madera, Ryan Calmus, Grant Thiltgen, Kevin ...
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
14 years 8 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...