6045 search results - page 356 / 1209 » Computable Linearizations of Well-partial-orderings |
206
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
227
click to vote
BMCBI
2006
15 years 7 months ago
2006
Background: Multiple sequence alignment (MSA) is a useful tool in bioinformatics. Although many MSA algorithms have been developed, there is still room for improvement in accuracy...
215
Voted
BMCBI
2006
15 years 7 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...
201
Voted
LICS
2005
IEEE
16 years 1 months ago
2005
IEEE
We introduce the language QML, a functional language for quantum computations on finite types. Its design is guided by its categorical semantics: QML programs are interpreted by ...
206
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...