Searching for gapped palindromes (Q1038475)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Searching for gapped palindromes	scientific article

Statements

scholarly article

0 references

Searching for gapped palindromes (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.tcs.2009.09.013

0 references

Gregory Kucherov

0 references

Roman M. Kolpakov

0 references

Theoretical Computer Science

0 references

publication date

18 November 2009

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2009.09.013

0 references

0 references

Palindromes in the Fibonacci word

0 references

Palindromes and Sturmian words

0 references

Developments in Language Theory

0 references

Palindrome complexity.

0 references

Palindrome recognition in real time by a multitape Turing machine

0 references

0 references

Palindrome recognition using a multidimensional tape.

0 references

0 references

Finding all periods and initial palindromes of a string in parallel

0 references

Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines

0 references

On the design of some systolic algorithms

0 references

Fast Pattern Matching in Strings

0 references

0 references

A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String

0 references

Algorithms on Strings, Trees and Sequences

0 references

Finding approximate palindromes in strings

0 references

0 references

Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays

0 references

Linear work suffix array construction

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1038475

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