Tatiana Starikovskaya
Title
Cited by
Cited by
Year
The k-mismatch problem revisited
R Clifford, A Fontaine, E Porat, B Sach, T Starikovskaya
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
482016
Wavelet trees meet suffix trees
M Babenko, P Gawrychowski, T Kociumaka, T Starikovskaya
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2014
422014
Dictionary matching in a stream
R Clifford, A Fontaine, E Porat, B Sach, T Starikovskaya
Algorithms-ESA 2015, 361-372, 2015
332015
Approximate Hamming distance in a stream
R Clifford, T Starikovskaya
arXiv preprint arXiv:1602.07241, 2016
272016
Sublinear space algorithms for the longest common substring problem
T Kociumaka, T Starikovskaya, HW Vildhøj
European Symposium on Algorithms, 605-617, 2014
242014
Streaming k-mismatch with error correcting and applications
J Radoszewski, T Starikovskaya
Information and Computation 271, 104513, 2020
212020
Cross-document pattern matching
T Kopelowitz, G Kucherov, Y Nekrich, T Starikovskaya
Journal of Discrete Algorithms 24, 40-47, 2014
182014
Time-space trade-offs for the longest common substring problem
T Starikovskaya, HW Vildhøj
Annual Symposium on Combinatorial Pattern Matching, 223-234, 2013
182013
Computing lempel-ziv factorization online
T Starikovskaya
International Symposium on Mathematical Foundations of Computer Science, 789-799, 2012
172012
Computing the longest common substring with one mismatch
MA Babenko, TA Starikovskaya
Problems of Information Transmission 47 (1), 28-33, 2011
172011
Longest common substring with approximately k mismatches
T Kociumaka, J Radoszewski, T Starikovskaya
Algorithmica 81 (6), 2633-2652, 2019
152019
Upper and lower bounds for dynamic data structures on strings
R Clifford, A Grønlund, KG Larsen, T Starikovskaya
arXiv preprint arXiv:1802.06545, 2018
142018
A suffix tree or not a suffix tree?
T Starikovskaya, HW Vildhøj
Journal of Discrete Algorithms 32, 14-23, 2015
142015
Pattern matching on sparse suffix trees
R Kolpakov, G Kucherov, T Starikovskaya
2011 First International Conference on Data Compression, Communications and …, 2011
132011
Computing longest common substrings via suffix arrays
MA Babenko, TA Starikovskaya
International Computer Science Symposium in Russia, 64-75, 2008
132008
Longest common substring with approximately k mismatches
T Starikovskaya
27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016
102016
Communication and streaming complexity of approximate pattern matching
T Starikovskaya
28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017
92017
Computing minimal and maximal suffixes of a substring
M Babenko, P Gawrychowski, T Kociumaka, I Kolesnichenko, ...
Theoretical Computer Science 638, 112-121, 2016
92016
On maximal unbordered factors
A Loptev, G Kucherov, T Starikovskaya
Annual Symposium on Combinatorial Pattern Matching, 343-354, 2015
82015
Cross-document pattern matching
G Kucherov, Y Nekrich, T Starikovskaya
Annual Symposium on Combinatorial Pattern Matching, 196-207, 2012
82012
The system can't perform the operation now. Try again later.
Articles 1–20