State Complexity of Neighbourhoods and Approximate Pattern Matching

International Journal of Foundations of Computer Science - Singapore
doi 10.1142/s0129054118400099
Full Text
Abstract

Available in full text

Date
Authors
Publisher

World Scientific Pub Co Pte Lt

Related search

A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1997English

SAFE Features for Matching Fingermarks by Neighbourhoods of Single Minutiae

2014English

An Adaptive Approach of Approximate Substring Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Constrained Pattern Matching

ACM Transactions on Algorithms
Mathematics
2011English

Image Compression Using Approximate Matching and Run Length

International Journal of Advanced Computer Science and Applications
Computer Science
2011English

Approximate Maximum Matching in Random Streams

2020English

General Pattern Matching

Chapman & Hall/CRC Applied Algorithms and Data Structures series
2009English

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

Combinatorial Pattern Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1994English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy