Sciweavers

3257 search results - page 595 / 652
» Some Results on Effective Randomness
Sort
View
BMCBI
2010
132views more  BMCBI 2010»
15 years 1 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
BMCBI
2008
149views more  BMCBI 2008»
15 years 1 months ago
All-paths graph kernel for protein-protein interaction extraction with evaluation of cross-corpus learning
Background: Automated extraction of protein-protein interactions (PPI) is an important and widely studied task in biomedical text mining. We propose a graph kernel based approach ...
Antti Airola, Sampo Pyysalo, Jari Björne, Tap...
110
Voted
BMCBI
2006
165views more  BMCBI 2006»
15 years 1 months ago
A stable gene selection in microarray data analysis
Background: Microarray data analysis is notorious for involving a huge number of genes compared to a relatively small number of samples. Gene selection is to detect the most signi...
Kun Yang, Zhipeng Cai, Jianzhong Li, Guohui Lin
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 1 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
109
Voted
DAC
2007
ACM
16 years 2 months ago
IPR: An Integrated Placement and Routing Algorithm
Abstract-- In nanometer-scale VLSI technologies, several interconnect issues like routing congestion and interconnect delay have become the main concerns in placement. However, all...
Min Pan, Chris C. N. Chu