Sciweavers

575 search results - page 3 / 115
» Computing Maximum Subsequence in Parallel
Sort
View
CONCUR
2008
Springer
15 years 1 months ago
Subsequence Invariants
We introduce subsequence invariants, which characterize the behavior of a concurrent system in terms of the occurrences of synchronization events. Unlike state invariants, which re...
Klaus Dräger, Bernd Finkbeiner
CORR
2002
Springer
78views Education» more  CORR 2002»
14 years 11 months ago
Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications
an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...
Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu
BIOINFORMATICS
2002
82views more  BIOINFORMATICS 2002»
14 years 11 months ago
TREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing
Heiko A. Schmidt, Korbinian Strimmer, Martin Vingr...
ALGORITHMICA
2006
94views more  ALGORITHMICA 2006»
14 years 11 months ago
Efficient Algorithms for k Maximum Sums
We study the problem of computing the k maximum sum subsequences. Given a sequence of real numbers x1, x2, . . . , xn and an integer parameter k, 1 k 1 2 n(n - 1), the problem in...
Fredrik Bengtsson, Jingsen Chen