Finding Gapped Palindromes Online (Q2819503)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Finding Gapped Palindromes Online	scientific article

Statements

scholarly article

0 references

Finding Gapped Palindromes Online (English)

0 references

0 references

Michitaro Nakamura

0 references

Shunsuke Inenaga

0 references

0 references

Masayuki Takeda

0 references

Lecture Notes in Computer Science

0 references

publication date

29 September 2016

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-44543-4_15

0 references

Parallel detection of all palindromes in a string

0 references

0 references

Dynamic LCA Queries on Trees

0 references

On the sorting-complexity of suffix tree construction

0 references

Efficiently Finding All Maximal alpha-gapped Repeats

0 references

Algorithms on Strings, Trees and Sequences

0 references

0 references

Searching for gapped palindromes

0 references

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

0 references

On-line construction of suffix trees

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-44543-4_15

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2819503

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