ADaM: Augmenting Existing Approximate Fast Matching Algorithms With Efficient and Exact Range Queries

BMC Bioinformatics - United Kingdom
doi 10.1186/1471-2105-15-s7-s1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Fast Algorithms for Approximate Circular String Matching

Algorithms for Molecular Biology
Computational TheoryApplied MathematicsStructural BiologyMolecular BiologyMathematics
2014English

Range Minima Queries With Respect to a Random Permutation, and Approximate Range Counting

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2010English

Vector Algorithms for Approximate String Matching

International Journal of Foundations of Computer Science
Computer Science
2002English

Indexing Variable Length Substrings for Exact and Approximate Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Efficient Algorithms for Processing XPath Queries

ACM Transactions on Database Systems
Information Systems
2005English

A Comparison of Approximate String Matching Algorithms

Software - Practice and Experience
Software
1996English

Stochastic Algorithms for Exact and Approximate Feasibility of Robust LMIs

IEEE Transactions on Automatic Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
2001English

Space-Efficient Range-Sum Queries in OLAP

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Correction To: New Algorithms for Fixed-Length Approximate String Matching and Approximate Circular String Matching Under the Hamming Distance

Journal of Supercomputing
HardwareInformation SystemsTheoretical Computer ScienceArchitectureSoftware
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy