?
Computing minimal and maximal suffixes of a substring
Theoretical Computer Science. 2016. Vol. 638. P. 112–121.
We consider the problems of computing the maximal and the minimal non-empty suffixes of substrings of a longer text of length . n. For the minimal suffix problem we show that for every . τ, . 1≤τ≤logn, there exists a linear-space data structure with . O(τ) query time and . O(nlogn/τ) preprocessing time. As a sample application, we show that this data structure can be used to compute the Lyndon decomposition of any substring of the text in . O(kτ) time, where . k is the number of distinct factors in the decomposition. For the maximal suffix problem, we give a linear-space structure with . O(1) query time and . O(n) preprocessing time. In other words, we simultaneously achieve both the optimal query time and the optimal construction time. © 2015 Elsevier B.V.
Рубцов А. А., Вялый М. Н., , in: Descriptional Complexity of Formal Systems: 23rd IFIP WG 1.02 International Conference, DCFS 2021, Virtual Event, September 5, 2021, Proceedings.: Springer, 2021. P. 150–162.
Добавлено: 2 февраля 2022 г.
Springer, 2019.
Добавлено: 26 октября 2021 г.
Бабенко М. А., Колесниченко И. И., Smirnov I., Theory of Computing Systems 2019 Vol. 63 No. 4 P. 637–646
Heaps are well-studied fundamental data structures, having myriads of applications, both theoretical and practical. We consider the problem of designing a heap with an “optimal” extract-min operation. Assuming an arbitrary linear ordering of keys, a heap with n elements typically takes O(log n) time to extract the minimum. Extracting all elements faster is impossible as ...
Добавлено: 6 декабря 2019 г.
Springer, 2019.
Добавлено: 4 августа 2019 г.
Галимуллин М. Ф., Калишенко Е. Л., Рапоткин Н. А., Известия Санкт-Петербургского государственного электротехнического университета ЛЭТИ 2016 № 7 С. 13–23
Рассматриваются некоторые сценарии использования конкурентных структур данных, показывающие повышение производительности при увеличении времени работы одного потока, которому остальные потоки делегируют свои задачи. Данный подход получил название flat-combining (FC) [1]. Представлены несколько разработанных стратегий синхронизации, описаны их преимущества и область применения. ...
Добавлено: 1 ноября 2018 г.
Бабкина Т. С., Демидовский А. В., Бабкин Э. А., International Journal of Big Data Intelligence 2018 Vol. 5 No. 3 P. 143–155
В этой работе представлены два новых подхода к решению классической NP-трудной задачи по поиску максимальной клики. Эта задача, которая часто возникает в области управления информацией, включая проектирование структур баз данных и обработку больших объемов данных. В нашем исследовании мы фокусируемся на решении этой задачи с использованием парадигмы искусственных нейронных сетей. Первый подход объединяет парадигму искусственных нейро-сетей и ...
Добавлено: 3 октября 2018 г.
Berlin, Heidelberg: Springer, 2017.
The 12th issue of LNCS Transactions on Petri Nets and Other Models of Concurrency (ToPNoC) contains revised and extended versions of a selection of the best papers from the workshops held at the 37th International Conference on Application and Theory of Petri Nets and Concurrency (Petri Nets 2016, Toruń, Poland, 19–24 June 2016), and the ...
Добавлено: 27 сентября 2017 г.
Бабенко М. А., Gawrychowski P., Kociumaka T. и др., , in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms.: San Diego: SIAM, 2015. P. 572–591.
We present an improved wavelet tree construction algorithm and discuss its applications to a number of rank/select problems for integer keys and strings. Given a string of length n over an alphabet of size ω ≤ n, our method builds the wavelet tree in O(n log ω √log n) time, improving upon the state-of-the-art algorithm ...
Добавлено: 4 октября 2014 г.
Vildhoj H. W., Стариковская Т. А., , in: Combinatorial Algorithms. 25th International Workshop, IWOCA 2014, Duluth, MN, USA, October 15-17, 2014, Revised Selected PapersVol. 8986.: Springer, 2014. P. 338–350.
In this paper we study the structure of suffix trees. Given an unlabeled tree τ on n nodes and suffix links of its internal nodes, we ask the question “Is τ a suffix tree?”, i.e., is there a string S whose suffix tree has the same topological structure as τ? We place no restrictions on ...
Добавлено: 4 октября 2014 г.
Springer, 2014.
This book constitutes the proceedings of the 21st International Symposium on String Processing and Information Retrieval, SPIRE 2014, held in Ouro Preto, Brazil, in October 2014. The 20 full and 6 short papers included in this volume were carefully reviewed and selected from 45 submissions. The papers focus not only on fundamental algorithms in string ...
Добавлено: 4 октября 2014 г.
Babenko A., Lempitsky V., , in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2012).: Providence: IEEE, 2012. P. 3069–3076.
Добавлено: 1 октября 2014 г.
Бабенко М. А., Kociumaka T., Gawrychowski P. и др., , in: Lecture Notes in Computer ScienceVol. 8486: Proceedings of the 25th Annual Symposium on Combinatorial Pattern Matching.: Springer, 2014. P. 30–39.
Добавлено: 24 июня 2014 г.
Kucherov G., Nekrich Y., Стариковская Т. А., , in: Lecture Notes in Computer ScienceVol. 7354: Proceedings of the 23rd Symposium on Combinatorial Pattern Matching.: Berlin: Springer, 2012. P. 196–207.
We study a new variant of the string matching problem called {\em cross-document string matching}, which is the problem of indexing a collection of documents to support an efficient search for a pattern in a selected document, where the pattern itself is a substring of another document. Several variants of this problem are considered, ...
Добавлено: 30 октября 2013 г.
Berlin: Springer, 2012.
This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012, held in Helsinki, Finalnd, in July 2012.
The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The papers address issues of searching and matching strings and more complicated patterns ...
Добавлено: 30 октября 2013 г.
Kucherov G., Nekrich Y., Стариковская Т. А., , in: Lecture Notes in Computer ScienceVol. 7608: Proceedings of the 19th International Symposium on String Processing and Information Retrieval.: Berlin: Springer, 2012. P. 307–317.
We study the following three problems of computing generic or discriminating words for a given collection of documents. Given a pattern $P$ and a threshold $d$, we want to report (i) all longest extensions of $P$ which occur in at least $d$ documents, (ii) all shortest extensions of $P$ which occur in less than $d$ ...
Добавлено: 30 октября 2013 г.
Vildhoj H. W., Стариковская Т. А., , in: Lecture Notes in Computer ScienceVol. 7922: Proceedings of the 24th Symposium on Combinatorial Pattern Matching.: Berlin: Springer, 2013. P. 223–234.
Lexicographically minimal and lexicographically maximal suffixes of a string are fundamental notions of stringology. It is well known that the lexicographically minimal and maximal suffixes of a given string $S$ can be computed in linear time and space by constructing a suffix tree or a suffix array of $S$. Here we consider the case when ...
Добавлено: 30 октября 2013 г.
Babenko M., Kolesnichenko I., Стариковская Т. А., , in: Lecture Notes in Computer ScienceVol. 7922: Proceedings of the 24th Symposium on Combinatorial Pattern Matching.: Berlin: Springer, 2013. P. 28–37.
Lexicographically minimal and lexicographically maximal suffixes of a string are fundamental notions of stringology. It is well known that the lexicographically minimal and maximal suffixes of a given string S can be computed in linear time and space by constructing a suffix tree or a suffix array of S. Here we consider the case when ...
Добавлено: 30 октября 2013 г.