An Adaptive Approach of Approximate Substring Matching

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-32025-0_31
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Implementing an Adaptive Approach for Dense Stereo-Matching

ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
2012English

Hardware-Based Implementation of the Common Approximate Substring Algorithm

English

The Average Common Substring Approach to Phylogenomic Reconstruction

Journal of Computational Biology
GeneticsMolecular BiologyComputational TheorySimulationComputational MathematicsMathematicsModeling
2006English

Approximate Maximum Matching in Random Streams

2020English

Vector Algorithms for Approximate String Matching

International Journal of Foundations of Computer Science
Computer Science
2002English

A Comparison of Approximate String Matching Algorithms

Software - Practice and Experience
Software
1996English

A System for Approximate Tree Matching

IEEE Transactions on Knowledge and Data Engineering
Computational TheoryComputer Science ApplicationsInformation SystemsMathematics
1994English

An Optimization Approach for Approximate Nash Equilibria

English

Fingerprint Matching With an Evolutionary Approach

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy