1421 search results - page 248 / 285 » Algorithms for subsequence combinatorics |
127
click to vote
DAM
2010
15 years 3 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
143
Voted
ALMOB
2006
15 years 3 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
105
click to vote
BMCBI
2006
15 years 3 months ago
2006
Background: Gene expression microarray data is notoriously subject to high signal variability. Moreover, unavoidable variation in the concentration of transcripts applied to micro...
130
Voted
BMCBI
2006
15 years 3 months ago
2006
Background: We have recently introduced a predictive framework for studying gene transcriptional regulation in simpler organisms using a novel supervised learning algorithm called...
127
Voted
BMCBI
2006
15 years 3 months ago
2006
Background: An important class of interaction switches for biological circuits and disease pathways are short binding motifs. However, the biological experiments to find these bin...