We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
Computer-Supported Collaborative Learning (CSCL) is a new learning method that is receiving an increasing amount of attention in Taiwan. With the rapid growth in learning resource...
Background: The abundant data available for protein interaction networks have not yet been fully understood. New types of analyses are needed to reveal organizational principles o...
Taner Z. Sen, Andrzej Kloczkowski, Robert L. Jerni...
Background: Many of the most popular pre-processing methods for Affymetrix expression arrays, such as RMA, gcRMA, and PLIER, simultaneously analyze data across a set of predetermi...
Simon Katz, Rafael A. Irizarry, Xue Lin, Mark Trip...