Counting palindromes in substrings

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

2 Цитирования (Scopus)
Язык оригиналаАнглийский
Название основной публикацииString Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings
ИздательSpringer Verlag
Страницы290-303
Число страниц14
Том10508 LNCS
ISBN (печатное издание)9783319674278
DOI
СостояниеОпубликовано - 2017
Событие24th International Symposium on String Processing and Information Retrieval, SPIRE 2017 - Palermo, Италия
Продолжительность: 26 сен 201729 сен 2017

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

НазваниеLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Том10508 LNCS
ISSN (печатное издание)0302-9743
ISSN (электронное издание)1611-3349

Конференция

Конференция24th International Symposium on String Processing and Information Retrieval, SPIRE 2017
СтранаИталия
ГородPalermo
Период26/09/201729/09/2017

Отпечаток

Palindrome
Counting
Strings
Data structures
Query
Distinct
Online Algorithms
Data Structures
Zero

Ключевые слова

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

    • Theoretical Computer Science
    • Computer Science(all)

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

    • Компьютерные науки, Теория и методы

    Цитировать

    Rubinchik, M., & Shur, A. M. (2017). Counting palindromes in substrings. В String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings (Том 10508 LNCS, стр. 290-303). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10508 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-67428-5_25
    Rubinchik, Mikhail ; Shur, Arseny M. / Counting palindromes in substrings. String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings. Том 10508 LNCS Springer Verlag, 2017. стр. 290-303 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{2ae7fc59c7fc4424a36b43f569ae96a5,
    title = "Counting palindromes in substrings",
    keywords = "Counting palindromes, Eertree, Online algorithm, Palindrome, String algorithm",
    author = "Mikhail Rubinchik and Shur, {Arseny M.}",
    year = "2017",
    doi = "10.1007/978-3-319-67428-5_25",
    language = "English",
    isbn = "9783319674278",
    volume = "10508 LNCS",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "290--303",
    booktitle = "String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings",
    address = "Germany",

    }

    Rubinchik, M & Shur, AM 2017, Counting palindromes in substrings. в String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings. том. 10508 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), том. 10508 LNCS, Springer Verlag, стр. 290-303, 24th International Symposium on String Processing and Information Retrieval, SPIRE 2017, Palermo, Италия, 26/09/2017. https://doi.org/10.1007/978-3-319-67428-5_25

    Counting palindromes in substrings. / Rubinchik, Mikhail; Shur, Arseny M.

    String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings. Том 10508 LNCS Springer Verlag, 2017. стр. 290-303 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 10508 LNCS).

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

    TY - GEN

    T1 - Counting palindromes in substrings

    AU - Rubinchik, Mikhail

    AU - Shur, Arseny M.

    PY - 2017

    Y1 - 2017

    KW - Counting palindromes

    KW - Eertree

    KW - Online algorithm

    KW - Palindrome

    KW - String algorithm

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

    UR - https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000463252100025

    U2 - 10.1007/978-3-319-67428-5_25

    DO - 10.1007/978-3-319-67428-5_25

    M3 - Conference contribution

    SN - 9783319674278

    VL - 10508 LNCS

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

    SP - 290

    EP - 303

    BT - String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings

    PB - Springer Verlag

    ER -

    Rubinchik M, Shur AM. Counting palindromes in substrings. В String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Proceedings. Том 10508 LNCS. Springer Verlag. 2017. стр. 290-303. (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-67428-5_25