Sciweavers

98 search results - page 8 / 20
» Testing the Maximum Entropy Principle for Information Retrie...
Sort
View
RECOMB
2005
Springer
14 years 7 months ago
Information Theoretic Approaches to Whole Genome Phylogenies
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
David Burstein, Igor Ulitsky, Tamir Tuller, Benny ...
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
14 years 4 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
CSB
2005
IEEE
149views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Combinatorial method of splice sites prediction
Predicting and proper ranking of splice sites (SS) is a challenging problem in bioinformatics and machine learning communities. Proposed method of donor and acceptor SSs predictio...
Alexander G. Churbanov, Hesham H. Ali
TREC
2003
13 years 8 months ago
Edinburgh-Stanford TREC-2003 Genomics Track
We describe our participation in both tasks in the 2003 TREC Genomics track. For the primary task we concentrated mainly upon query expansion and species-specific document search...
Miles Osborne, Mark Cuminskey, Gail Sinclair, Matt...
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 2 months ago
Concavity of Mutual Information Rate for Input-Restricted Finite-State Memoryless Channels at High SNR
We consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavio...
Guangyue Han, Brian H. Marcus