Reducing Approximate Longest Common Subsequence to Approximate Edit Distance

doi 10.1137/1.9781611975994.98
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

MACFP: Maximal Approximate Consecutive Frequent Pattern Mining Under Edit Distance

2016English

Beam Search for the Longest Common Subsequence Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2009English

Approximate Distance Oracles

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2005English

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

Approximate Double Commutants and Distance Formulas

Operators and Matrices
Number TheoryAnalysisAlgebra
2014English

Using Google Distance to Weight Approximate Ontology Matches

2007English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Approximate Joint Diagonalization According to the Natural Riemannian Distance

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy