Locating All Maximal Approximate Runs in a String

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-38905-4_4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Extracting Powers and Periods in a String From Its Runs Structure

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

A Comparison of Approximate String Matching Algorithms

Software - Practice and Experience
Software
1996English

Vector Algorithms for Approximate String Matching

International Journal of Foundations of Computer Science
Computer Science
2002English

Parallel Detection of All Palindromes in a String

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1995English

Fast Algorithms for Approximate Circular String Matching

Algorithms for Molecular Biology
Computational TheoryApplied MathematicsStructural BiologyMolecular BiologyMathematics
2014English

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

Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach

2012English

The Flamingo Software Package on Approximate String Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Optimal Spaced Seeds for Faster Approximate String Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy