A GPU Implementation of a Bit-Parallel Algorithm for Computing the Longest Common Subsequence

IPSJ Online Transactions
doi 10.2197/ipsjtrans.7.139
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Information Processing Society of Japan

Related search

Beam Search for the Longest Common Subsequence Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2009English

A Comprehensive Comparison of Metaheuristics for the Repetition-Free Longest Common Subsequence Problem

Journal of Heuristics
ControlInformation SystemsManagement ScienceComputer NetworksCommunicationsOptimizationOperations ResearchArtificial IntelligenceSoftware
2017English

Acceleration of Sequence Clustering Using Longest Common Subsequence Filtering

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2013English

Bounds on the Complexity of the Longest Common Subsequence Problem

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1976English

Hybrid Techniques Based on Solving Reduced Problem Instances for a Longest Common Subsequence Problem

Applied Soft Computing Journal
Software
2018English

Reducing Approximate Longest Common Subsequence to Approximate Edit Distance

2020English

GPU-OSDDA: A Bit-Vector GPU-based Deadlock Detection Algorithm for Single-Unit Resource Systems

International Journal of Parallel, Emergent and Distributed Systems
Computer NetworksSoftwareCommunications
2015English

Non-Universality for Longest Increasing Subsequence of a Random Walk

Alea
StatisticsProbability
2017English

Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers

SIAM Journal on Computing
MathematicsComputer Science
1987English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy