OpenAlex
PricingAboutJobs
Log inGet started
Work

Efficient string matching with k mismatches

HTML PDF

Year: 1986
Type: article
Source: Theoretical Computer Science
DOI: 10.1016/0304-3975(86)90178-7
Authors: Gad M. Landau, Uzi Vishkin
Institutions: Tel Aviv University, Courant Institute of Mathematical Sciences, New York University
Language: English

Topic: Algorithms and Data Compression
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Keywords: string matching, k mismatches, approximate pattern matching, pattern occurrences, time complexity

Open Access status: bronze

Funders: National Science Foundation, U.S. Department of Energy, Office of Naval Research, Division of Mathematical Sciences
Awards: Synchronous Parallel Computation-Efficiency of Resources (Computer Research), VLSI Architecture for Ultraparallel Computers, G8876996369, G969889393
OpenAlex ID: W1977613481
FWCI: 5.275
Cites: 9
Cited by: 226
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security