Periodic String Comparison (Q3637113)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Periodic String Comparison	scientific article

Statements

scholarly article

0 references

Periodic String Comparison (English)

0 references

Combinatorial Pattern Matching

0 references

publication date

7 July 2009

0 references

Alexander Tiskin

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-02441-2_18

0 references

An all-substrings common subsequence algorithm

0 references

Tandem cyclic alignment

0 references

Identifying periodic occurrences of a template with applications to protein structure

0 references

Two algorithms for LCS consecutive suffix alignment

0 references

On the Common Substring Alignment Problem

0 references

A faster algorithm computing string edit distances

0 references

Approximate matching of regular expressions

0 references

All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings

0 references

The theory and computation of evolutionary distances: Pattern recognition

0 references

Semi-local longest common subsequences in subquadratic time

0 references

Semi-local string comparison: algorithmic techniques and applications

0 references

The String-to-String Correction Problem

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-02441-2_18

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3637113

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