Results 81 to 90 of about 16,556 (177)
Divide-and-Conquer Multiple Sequence Alignment
, 1997 Stoye J. Divide-and-Conquer Multiple Sequence Alignment. Forschungsberichte.
Jens Stoye +1 more
core
Statistically consistent divide-and-conquer pipelines for phylogeny estimation using NJMerge
Algorithms for Molecular Biology, 2019 Background Divide-and-conquer methods, which divide the species set into overlapping subsets, construct a tree on each subset, and then combine the subset trees using a supertree method, provide a key algorithmic framework for boosting the scalability of
Erin K. Molloy, Tandy Warnow
doaj +1 more source
Divide-and-Conquer With Sequential Monte Carlo [PDF]
, 2018 We propose a novel class of Sequential Monte Carlo (SMC) algorithms, appropriate for inference in probabilistic graphical models. This class of algorithms adopts a divide-and-conquer approach based upon an auxiliary tree-structured decomposition of the ...
core +2 more sources
Parallel combinator reduction : some performance bounds [PDF]
A parallel graph reduction machine simulator is described. This performs combinator reduction and can simulate various different parallel reduction strategies. A number of functional programs are examined, and experimental results presented comparing the
Joy, Mike, Axford, Tom
core
Divide-and-Conquer Programming with Minimally Synchronous Parallel ML
, 2007 International audienceMinimally Synchronous Parallel ML (MSPML) is a functional parallel programming language. It is based on a small number of primitives on a parallel data structure.
Benheddi, Radia, Loulergue, Frédéric
core +1 more source
Divide-and-conquer-Algorithmen auf dem Hyperwürfel
, 2006 Wir haben in dieser Arbeit einige Probleme auf Objekten betrachtet, deren Struktur wohlgeformten Klammerworten entspricht. Dies waren spezielle Routing-Probleme, das Umformen und Auswerten algebraischer Ausdrücke, sowie die Berechnung korrespondierender ...
Werchner, Ralph
core
Divide-and-conquer algorithms for multiprocessors
, 1991 During the past decade there has been a tremendous surge in understanding the nature of parallel computation. A number of parallel computers are commercially available.
Mukkavilli, Lakshmankumar
core +1 more source
The automatic complexity analysis of divide-and-conquer algorithms [PDF]
, 1989 Projet EURECACurrent tools performing automatic complexity analysis are capable to deal with function definitions based on structural induction. Divide-and-conquer algorithms with "intelligent" divide function (like quicksort) are not based on structural
Zimmermann, Paul, Zimmermann, Wolf
core +1 more source
Parallel Divide and Conquer [PDF]
, 1991 We develop a generic divide and conquer algorithm for a parallel tree machine. From the generic algorithm we derive balanced, parallel versions of quicksort and the fast Fourier transform by substitution of data types, variables and statements.
Hansen, Per Brinch
core
Mitochondrial dynamics in macrophages: divide to conquer or unite to survive? [PDF]
Biochem Soc Trans, 2023 Afroz SF +5 more
europepmc +1 more source