6358 search results - page 236 / 1272 » Computing spectral sequences |
163
click to vote
ISCAPDCS
2007
15 years 8 months ago
2007
In this paper we present a parallel implementation of T–Coffee — a widely used multiple sequence alignment package. Our software supports a majority of options provided by the...
171
click to vote
JCB
2000
15 years 6 months ago
2000
For aligning DNA sequences that differ only by sequencing errors, or by equivalent errors from other sources, a greedy algorithm can be much faster than traditional dynamic progra...
156
click to vote
AML
1999
15 years 6 months ago
1999
The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, t...
159
click to vote
EOR
2008
15 years 6 months ago
2008
The car sequencing problem consists in sequencing a given set of cars to be produced in a single day. We address one of the variants of this problem, in which the objective of mini...
194
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...