Multiple approximate string matching (Q5096936)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7573285

Language	Label	Description	Also known as
English	Multiple approximate string matching	scientific article; zbMATH DE number 7573285

Statements

scholarly article

0 references

Multiple approximate string matching (English)

0 references

zbMATH Open document ID

0 references

10.1007/3-540-63307-3_57

0 references

Lecture Notes in Computer Science

0 references

publication date

19 August 2022

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

Ricardo A. Baeza-Yates

0 references

Gonzalo Navarro

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/3-540-63307-3_57

0 references

0 references

Efficient string matching

0 references

Sublinear approximate string matching and biological applications

0 references

An Improved Algorithm For Approximate String Matching

0 references

Fast parallel and serial approximate string matching

0 references

A sublinear algorithm for approximate keyword searching

0 references

The theory and computation of evolutionary distances: Pattern recognition

0 references

0 references

0 references

Algorithms for approximate string matching

0 references

Finding approximate patterns in strings

0 references

Approximate string matching using withinword parallelism

0 references

A subquadratic algorithm for approximate limited expression matching

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5096936

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5096936&oldid=36844121"