Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Pattern matching with pair correlation distance

From MaRDI portal
Publication:955040
Jump to:navigation, search

DOI10.1016/j.tcs.2008.08.023zbMath1181.68332OpenAlexW2060580683MaRDI QIDQ955040

Asaf Zur, Ely Porat, Benny Porat

Publication date: 18 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.023



Mathematics Subject Classification ID

Algorithms on strings (68W32)


Related Items

A Simple Algorithm for Approximating the Text-To-Pattern Hamming Distance


Uses Software

  • Winnowing


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Efficient special cases of pattern matching with swaps
  • Alphabet dependence in parameterized matching
  • Parameterized pattern matching: Algorithms and applications
  • An Extension of the String-to-String Correction Problem
  • Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
  • A theory of parameterized pattern matching
  • Algorithms – ESA 2004
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:955040&oldid=12936404"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 19:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki