Výsledky vyhľadávania - Parallel algorithms for LCS
-
1
An OpenMP-based tool for finding longest common subsequence in bioinformatics
ISSN: 1756-0500, 1756-0500Vydavateľské údaje: London BioMed Central 11.04.2019Vydané v BMC research notes (11.04.2019)“… Result In this study, we develop three novel parallel versions of the LCS algorithm on: (i) distributed memory machine using message passing interface (MPI); (ii…”
Získať plný text
Journal Article -
2
A fast parallel algorithm for finding the longest common sequence of multiple biosequences
ISSN: 1471-2105, 1471-2105Vydavateľské údaje: England BioMed Central 12.12.2006Vydané v BMC bioinformatics (12.12.2006)“… A fast parallel algorithm for LCS is presented. The algorithm first constructs a novel successor table to obtain all the identical pairs and their levels…”
Získať plný text
Journal Article -
3
EFFICIENT PARALLEL ALGORITHMS FOR THE LIS AND LCS PROBLEMS ON BSR MODEL USING CONSTANT NUMBER OF SELECTIONS
ISSN: 1063-7192Vydavateľské údaje: Taylor & Francis Group 01.01.2000Vydané v Parallel algorithms and applications (01.01.2000)“… The model allows constant time solutions to sorting, parallel prefix and other problems. In this paper, we describe constant time solution to the longest common subsequence (LCS…”
Získať plný text
Journal Article -
4
A Parallel Algorithm for Solving LCS of Multiple Bioseqences
ISBN: 1424400619, 9781424400614ISSN: 2160-133XVydavateľské údaje: IEEE 01.08.2006Vydané v Proceedings (International Conference on Machine Learning and Cybernetics.) (01.08.2006)“…). Here L is the number of identical character tuples. The time complexity of our parallel algorithm is O(|LCS…”
Získať plný text
Konferenčný príspevok.. -
5
Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints
ISSN: 0167-8191, 1872-7336Vydavateľské údaje: Elsevier B.V 01.03.2020Vydané v Parallel computing (01.03.2020)“…’s recursive formula for solve a M-STR-EC-LCS problem.•Describing two BSP/CGM parallel algorithms based on our task graph.•Experimental study…”
Získať plný text
Journal Article -
6
Research and implementation of the GPU-based LCS algorithm acceleration mechanism
ISSN: 1000-436XVydavateľské údaje: Editorial Department of Journal on Communications 01.09.2013Vydané v Tongxin Xuebao (01.09.2013)“… set.A GPU based method for accelerating the LCS algorithm was proposed.The CUDA platform was built and dedoyed and the parallel of LCS algorithm was researched…”
Získať plný text
Journal Article -
7
Research and implementation of the GPU-based LCS algorithm acceleration mechanism
ISSN: 1000-436XVydavateľské údaje: Editorial Department of Journal on Communications 01.09.2013Vydané v Tongxin Xuebao (01.09.2013)“… A GPU based method for accelerating the LCS algorithm was proposed. The CUDA platform was built and dedoyed and the parallel of LCS algorithm was researched on this platform…”
Získať plný text
Journal Article -
8
BitPAl: a bit-parallel, general integer-scoring sequence alignment algorithm
ISSN: 1367-4803, 1367-4811, 1367-4811Vydavateľské údaje: England Oxford University Press 15.11.2014Vydané v Bioinformatics (Oxford, England) (15.11.2014)“…) and edit-distance problems, producing fast algorithms in practice. Results: We have developed BitPAl, a bit-parallel algorithm for general, integer-scoring global alignment…”
Získať plný text
Journal Article -
9
Parallel Longest Common SubSequence Analysis In Chapel
ISSN: 2643-1971Vydavateľské údaje: IEEE 25.09.2023Vydané v IEEE Conference on High Performance Extreme Computing (Online) (25.09.2023)“… In this paper, we select a typical parallel LCS algorithm and integrate it into our large-scale string analysis algorithm library to support different types of large string analysis…”
Získať plný text
Konferenčný príspevok.. -
10
Parallel progressive multiple sequence alignment on reconfigurable meshes
ISSN: 1471-2164, 1471-2164Vydavateľské údaje: London BioMed Central 23.12.2011Vydané v BMC genomics (23.12.2011)“… of sequences to be analyzed that exceeding the capability of traditional computing models. Therefore, an effective parallel multiple sequence alignment model capable of resolving these issues is in a great demand…”
Získať plný text
Journal Article -
11
Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint
ISBN: 1538678780, 9781538678787Vydavateľské údaje: IEEE 01.07.2018Vydané v 2018 International Conference on High Performance Computing and Simulation (HPCS) (01.07.2018)“… Based on a previous sequential algorithm, we propose two CGM parallel algorithms for STR-EC-LCS problem…”
Získať plný text
Konferenčný príspevok.. -
12
A Fast Multiple Longest Common Subsequence (MLCS) Algorithm
ISSN: 1041-4347, 1558-2191Vydavateľské údaje: New York, NY IEEE 01.03.2011Vydané v IEEE transactions on knowledge and data engineering (01.03.2011)“…, finding an LCS of any number of strings, and its parallel realization. The algorithm is based on the dominant point approach and employs a fast divide-and-conquer technique to compute the dominant points…”
Získať plný text
Journal Article -
13
XLCS: A New Bit-Parallel Longest Common Subsequence Algorithm on Xeon Phi Clusters
“… In this paper, we present XLCS, a new parallel implementation to accelerate the LCS algorithm on Xeon Phi clusters by performing bit-wise operations…”Vydavateľské údaje: IEEE 01.08.2019
Získať plný text
Konferenčný príspevok.. -
14
Parallel Longest Common Sequence Algorithm on Multicore Systems Using OpenACC, OpenMP and OpenMPI
Vydavateľské údaje: IEEE 01.09.2017Vydané v 2017 IEEE 11th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC) (01.09.2017)“… This problem is known to be NP-hard for arbitrary data. In this paper, we present a parallel LCS algorithm using the GPU-based OpenACC model, which is based on the existing…”
Získať plný text
Konferenčný príspevok.. -
15
Parallel Longest Common SubSequence Analysis In Chapel
ISSN: 2331-8422Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 16.09.2023Vydané v arXiv.org (16.09.2023)“… In this paper, we select a typical parallel LCS algorithm and integrate it into our large-scale string analysis algorithm library to support different types of large string analysis…”
Získať plný text
Paper -
16
A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem
ISSN: 0167-8191, 1872-7336Vydavateľské údaje: Elsevier B.V 01.07.2022Vydané v Parallel computing (01.07.2022)“…+(m+n)|Σ| time. We rely on this work to propose a parallel algorithm for the SSCLCS problem on the Coarse-Grained Multicomputer (CGM) model…”
Získať plný text
Journal Article -
17
On the parallelization of Hirschberg's algorithm for multi‐core and many‐core systems
ISSN: 1532-0626, 1532-0634Vydavateľské údaje: Hoboken Wiley Subscription Services, Inc 25.09.2019Vydané v Concurrency and computation (25.09.2019)“… To ensure the optimal solution is found, algorithms based on dynamic programming are employed almost exclusively…”
Získať plný text
Journal Article -
18
Tiling Dynamic Programming Computations to Maximize Parallelism
Vydavateľské údaje: IEEE 13.08.2025Vydané v 2025 IEEE International Conference on High Performance Computing and Communications (HPCC) (13.08.2025)“… In this paper, we propose a novel parallel LCS algorithm that combines antidiagonal tiling with lightweight semaphore-based synchronization to enhance cache locality and reduce inter-thread communication costs…”
Získať plný text
Konferenčný príspevok.. -
19
An associative architecture for genetic algorithm-based machine learning
ISSN: 0018-9162, 1558-0814Vydavateľské údaje: New York IEEE 01.11.1994Vydané v Computer (Long Beach, Calif.) (01.11.1994)“… This article describes an investigation and simulation of a massively parallel learning classifier system (LCS…”
Získať plný text
Journal Article -
20
A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem
ISSN: 0178-4617, 1432-0541Vydavateľské údaje: 01.07.2006Vydané v Algorithmica (01.07.2006)Získať plný text
Journal Article

