Výsledky vyhľadávania - "Dynamic Programming Table"

Reticular alignment: A progressive corner-cutting method for multiple sequence alignment Autor Szabó, Adrienn, Novák, Ádám, Miklós, István, Hein, Jotun

“… Unlike previous corner-cutting methods, our approach does not define a compact part of the dynamic programming table…”
Získať plný text

Towards sub-quadratic time and space complexity solutions for the dated tree reconciliation problem Autor Drinkwater, Benjamin, Charleston, Michael A.

“… Methods In this work we build on this prior analysis providing a further asymptotic space reduction, by providing a new formulation for the dynamic programming table used by a number of popular…”
Získať plný text

Space-efficient computation of parallel approximate string matching Autor Sadiq, Muhammad Umair, Yousaf, Muhammad Murtaza

“…Approximate string matching (ASM) has a number of applications in many disciplines, ranging from information retrieval to gene matching. Conventional solution…”
Získať plný text

A PTAS for k-hop MST on the Euclidean plane: Improving dependency on k Autor Fakcharoenphol, Jittat, Wongwattanakij, Nonthaphat

“…For any ϵ>0, Laue and Matijević [CCCG'07, IPL'08] give a PTAS for finding a (1+ϵ)-approximate solution to the k-hop MST problem in the Euclidean plane that…”
Získať plný text

Parallel solution of the subset-sum problem: an empirical study Autor Bokhari, Saniyah S.

“… This product defines the size of the dynamic programming table used to solve the problem. We show how this problem can be parallelized on three contemporary architectures, that is, a…”
Získať plný text

FPGA Acceleration of Pre-Alignment Filters for Short Read Mapping With HLS Autor Castells-Rufas, David, Marco-Sola, Santiago, Moure, Juan Carlos, Aguado, Quim, Espinosa, Antonio

“… Most of them are based on estimating or computing the edit distance between sequences and their candidate locations in a reference genome using a subset of the dynamic programming table used…”
Získať plný text

Randomization-Based Dynamic Programming Offloading Algorithm for Mobile Fog Computing Autor Bai, Wenle, Yang, Zhongjun, Zhang, Jianhong, Kumar, Rajiv

“… The algorithm innovatively designs a dynamic programming table-filling approach, i.e., iteratively generates a set of randomized offloading decisions…”
Získať plný text

US Patent Issued to MediaTek on July 24 for "Keyword spotting system for achieving low-latency keyword recognition by using multiple dynamic programming tables reset at different frames of acoustic data input and related keyword spotting method" (Taiwanese Inventor)

Získať plný text

OpenCL-based FPGA Accelerator for Semi-Global Approximate String Matching Using Diagonal Bit-Vectors Autor Castells-Rufas, David, Marco-Sola, Santiago, Aguado-Puig, Quim, Espinosa-Morales, Antonio, Moure, Juan Carlos, Alvarez, Lluc, Moreto, Miquel

“… Previous attempts to solve the same problem in FPGA use the Myers algorithm following a column approach to compute the dynamic programming table…”
Získať plný text

Application of Max-Plus algebra to biological sequence comparisons Autor Comet, J.-P.

“…) can be seen as a sequence of elementary operations in (max,+) algebra: each line (viewed as a vector) of the dynamic programming table of the alignment algorithms can be deduced…”
Získať plný text

Approximate pattern matching and transitive closure logics Autor Lemström, Kjell, Hella, Lauri

“…; a minimizing path of a dynamic programming table is expressed by using a formula in an extension…”
Získať plný text

A dynamic programming offloading algorithm for mobile cloud computing Autor Shahzad, Haleh, Szymanski, Ted H.

“…Computational offloading is an effective method to address the limited battery power of a mobile device, by executing some components of a mobile application…”
Získať plný text

Complex Network Analysis Using Parallel Approximate Motif Counting Autor Slota, George M., Madduri, Kamesh

“… In this paper, we introduce a distributed-memory parallelization of FASCIA by partitioning the graph and the dynamic programming table…”
Získať plný text

Generating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2) Autor Sawada, J., Ruskey, F.

“… We develop an algorithm that uses a dynamic programming table to efficiently generate the standard bracketing for all Lyndon words of length n, thus constructing…”
Získať plný text

A Faster FPTAS for the Subset-Sums Ratio Problem Autor Melissinos, Nikolaos, Pagourtzis, Aris

“… Proc. Lett. 113 (2013)]. One of the key improvements of our scheme is the use of a dynamic programming table in which one dimension represents the difference of the sums of the two subsets…”
Získať plný text

Implementing EM and Viterbi algorithms for Hidden Markov Model in linear memory Autor Churbanov, Alexander, Winters-Hilt, Stephen

“…Background The Baum-Welch learning procedure for Hidden Markov Models (HMMs) provides a powerful tool for tailoring HMM topologies to data for use in knowledge…”
Získať plný text

Exact and Heuristic Approaches to Speeding Up the MSM Time Series Distance Computation Autor Holznigenkemper, Jana, Komusiewicz, Christian, Seeger, Bernhard

“…\) is the length of the longest time series. In this paper, we provide approaches to reducing the cost of MSM distance computations by using lower and upper bounds for early pruning paths in the underlying dynamic programming table…”
Získať plný text

Analysis of Sequential Data Using HMMs Autor Winters-Hilt, Stephen

“… sequential analysis with the efficient dynamic programming table constructions possible on a computer…”
Získať plný text

Algorithms in Bioinformatics: A Practical Introduction Autor Sung, Wing-Kin

“…This classroom-tested text provides an in-depth introduction to the algorithmic techniques applied in bioinformatics. For each topic, the author clearly…”
Získať plný text

Quantum Speedups for Exponential-Time Dynamic Programming Algorithms Autor Ambainis, Andris, Balodis, Kaspars, Iraids, Jānis, Martins Kokainis, Prūsis, Krišjānis, Vihrovs, Jevgēnijs

“… We give a quantum algorithm that solves path in the hypercube in time \(O^*(1.817^n)\). The technique combines Grover's search with computing a partial dynamic programming table…”
Získať plný text