6251 search results - page 947 / 1251 » Randomness, Computability, and Density |
192
click to vote
RECOMB
2006
Springer
16 years 7 months ago
2006
Springer
In this paper, we present CONTRAlign, an extensible and fully automatic framework for parameter learning and protein pairwise sequence alignment using pair conditional random field...
200
click to vote
RECOMB
2005
Springer
16 years 7 months ago
2005
Springer
Abstract. Identification of homologous chromosomal regions is important for understanding evolutionary processes that shape genome evolution, such as genome rearrangements and larg...
169
click to vote
RECOMB
2004
Springer
16 years 7 months ago
2004
Springer
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
210
click to vote
RECOMB
2003
Springer
16 years 7 months ago
2003
Springer
Although analysis of genome rearrangements was pioneered by Dobzhansky and Sturtevant 65 years ago, we still know very little about the rearrangement events that produced the exis...
183
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...