Sciweavers

359 search results - page 22 / 72
» On Complexity of Easy Predictable Sequences
Sort
View
BMCBI
2005
150views more  BMCBI 2005»
13 years 7 months ago
Discover protein sequence signatures from protein-protein interaction data
Background: The development of high-throughput technologies such as yeast two-hybrid systems and mass spectrometry technologies has made it possible to generate large protein-prot...
Jianwen Fang, Ryan J. Haasl, Yinghua Dong, Gerald ...
BMCBI
2008
123views more  BMCBI 2008»
13 years 7 months ago
A tree-based conservation scoring method for short linear motifs in multiple alignments of protein sequences
Background: The structure of many eukaryotic cell regulatory proteins is highly modular. They are assembled from globular domains, segments of natively disordered polypeptides and...
Claudia Chica, Alberto Labarga, Cathryn M. Gould, ...
BMCBI
2007
156views more  BMCBI 2007»
13 years 7 months ago
Predictive modeling of plant messenger RNA polyadenylation sites
Background: One of the essential processing events during pre-mRNA maturation is the posttranscriptional addition of a polyadenine [poly(A)] tail. The 3'-end poly(A) track pr...
Guoli Ji, Jianti Zheng, Yingjia Shen, Xiaohui Wu, ...
ACL
2009
13 years 5 months ago
Distributional Representations for Handling Sparsity in Supervised Sequence-Labeling
Supervised sequence-labeling systems in natural language processing often suffer from data sparsity because they use word types as features in their prediction tasks. Consequently...
Fei Huang, Alexander Yates
ESOP
2001
Springer
14 years 6 days ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing