2031 search results - page 173 / 407 » On Tree-Constrained Matchings and Generalizations |
75
Voted
BMCBI
2006
14 years 10 months ago
2006
Background: The identification of a consensus RNA motif often consists in finding a conserved secondary structure with minimum free energy in an ensemble of aligned sequences. How...
88
Voted
DAM
2007
14 years 10 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
81
Voted
JFP
2006
14 years 10 months ago
2006
Even in statically typed languages it is useful to have certain invariants checked dynamically. Findler and Felleisen gave an algorithm for dynamically checking expressive highero...
106
click to vote
SIGIR
2008
ACM
14 years 10 months ago
2008
ACM
Motivated by our work with political scientists who need to manually analyze large Web archives of news sites, we present SpotSigs, a new algorithm for extracting and matching sig...
92
Voted
BMCBI
2005
14 years 10 months ago
2005
Background: Protein sequence alignments have become indispensable for virtually any evolutionary, structural or functional study involving proteins. Modern sequence search and com...