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

Applied Soft Computing Journal - Netherlands
doi 10.1016/j.asoc.2017.10.005
Full Text
Abstract

Available in full text

Categories
Software
Date
Authors
Publisher

Elsevier BV

Related search

Beam Search for the Longest Common Subsequence Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2009English

Bounds on the Complexity of the Longest Common Subsequence Problem

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1976English

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

Journal of Heuristics
ControlInformation SystemsManagement ScienceComputer NetworksCommunicationsOptimizationOperations ResearchArtificial IntelligenceSoftware
2017English

Construct, Merge, Solve and Adapt: Application to the Repetition-Free Longest Common Subsequence Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Acceleration of Sequence Clustering Using Longest Common Subsequence Filtering

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2013English

Time-Space Trade-Offs for the Longest Common Substring Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

A Problem Solving Environment Based on CORBA

Scientific Programming
Computer Science ApplicationsSoftware
2001English

Reducing Approximate Longest Common Subsequence to Approximate Edit Distance

2020English

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

IPSJ Online Transactions
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy