EERTREE: An efficient data structure for processing palindromes in strings

Результат исследований: Глава в книге, отчете, сборнике статейМатериалы конференцииНаучно-исследовательскаярецензирование

13 Цитирования (Scopus)
Язык оригиналаАнглийский
Название основной публикацииLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ИздательSpringer Verlag
Страницы321-333
Число страниц13
Том9538
ISBN (печатное издание)9783319295152
DOI
СостояниеОпубликовано - 2016
Событие26th International Workshop on Combinatorial Algorithms, IWOCA 2015 - Verona, Италия
Продолжительность: 5 окт 20157 окт 2015

Серия публикаций

НазваниеLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Том9538
ISSN (печатное издание)03029743
ISSN (электронное издание)16113349

Конференция

Конференция26th International Workshop on Combinatorial Algorithms, IWOCA 2015
СтранаИталия
ГородVerona
Период05/10/201507/10/2015

Отпечаток

Palindrome
Data structures
Data Structures
Strings
Suffix Tree
Suffix
Processing
Efficient Solution

Предметные области ASJC Scopus

  • Computer Science(all)
  • Theoretical Computer Science

Цитировать

Rubinchik, M., & Shur, A. M. (2016). EERTREE: An efficient data structure for processing palindromes in strings. В Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Том 9538, стр. 321-333). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 9538). Springer Verlag. https://doi.org/10.1007/978-3-319-29516-9_27
Rubinchik, Mikhail ; Shur, Arseny M. / EERTREE: An efficient data structure for processing palindromes in strings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Том 9538 Springer Verlag, 2016. стр. 321-333 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d662fb3740dc4c5783012b769bbbd303,
title = "EERTREE: An efficient data structure for processing palindromes in strings",
author = "Mikhail Rubinchik and Shur, {Arseny M.}",
year = "2016",
doi = "10.1007/978-3-319-29516-9_27",
language = "English",
isbn = "9783319295152",
volume = "9538",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "321--333",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",

}

Rubinchik, M & Shur, AM 2016, EERTREE: An efficient data structure for processing palindromes in strings. в Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). том. 9538, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), том. 9538, Springer Verlag, стр. 321-333, 26th International Workshop on Combinatorial Algorithms, IWOCA 2015, Verona, Италия, 05/10/2015. https://doi.org/10.1007/978-3-319-29516-9_27

EERTREE: An efficient data structure for processing palindromes in strings. / Rubinchik, Mikhail; Shur, Arseny M.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Том 9538 Springer Verlag, 2016. стр. 321-333 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 9538).

Результат исследований: Глава в книге, отчете, сборнике статейМатериалы конференцииНаучно-исследовательскаярецензирование

TY - GEN

T1 - EERTREE: An efficient data structure for processing palindromes in strings

AU - Rubinchik, Mikhail

AU - Shur, Arseny M.

PY - 2016

Y1 - 2016

UR - http://www.scopus.com/inward/record.url?scp=84961226250&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-29516-9_27

DO - 10.1007/978-3-319-29516-9_27

M3 - Conference contribution

SN - 9783319295152

VL - 9538

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 321

EP - 333

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -

Rubinchik M, Shur AM. EERTREE: An efficient data structure for processing palindromes in strings. В Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Том 9538. Springer Verlag. 2016. стр. 321-333. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-29516-9_27