3 |
On the Complexity of BWT-Runs Minimization via Alphabet Reordering ...
|
|
|
|
BASE
|
|
Show details
|
|
4 |
On the Hardness and Inapproximability of Recognizing Wheeler Graphs
|
|
Gibney, Daniel; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual European Symposium on Algorithms (ESA 2019), 2019
|
|
BASE
|
|
Show details
|
|
5 |
On the Hardness and Inapproximability of Recognizing Wheeler Graphs ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
On the Complexity of BWT-runs Minimization via Alphabet Reordering ...
|
|
|
|
BASE
|
|
Show details
|
|
7 |
On the Hardness and Inapproximability of Recognizing Wheeler Graphs ...
|
|
|
|
BASE
|
|
Show details
|
|
9 |
Structural Pattern Matching - Succinctly
|
|
Ganguly, Arnab; Shah, Rahul; Thankachan, Sharma V.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. 28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017
|
|
BASE
|
|
Show details
|
|
10 |
Structural Pattern Matching - Succinctly ...
|
|
|
|
Abstract:
Let T be a text of length n containing characters from an alphabet \Sigma, which is the union of two disjoint sets: \Sigma_s containing static characters (s-characters) and \Sigma_p containing parameterized characters (p-characters). Each character in \Sigma_p has an associated complementary character from \Sigma_p. A pattern P (also over \Sigma) matches an equal-length substring $S$ of T iff the s-characters match exactly, there exists a one-to-one function that renames the p-characters in S to the p-characters in P, and if a p-character x is renamed to another p-character y then the complement of x is renamed to the complement of y. The task is to find the starting positions (occurrences) of all such substrings S. Previous indexing solution [Shibuya, SWAT 2000], known as Structural Suffix Tree, requires \Theta(n\log n) bits of space, and can find all occ occurrences in time O(|P|\log \sigma+ occ), where \sigma = |\Sigma|. In this paper, we present the first succinct index for this problem, which occupies n ...
|
|
Keyword:
Computer Science
|
|
URL: http://drops.dagstuhl.de/opus/volltexte/2017/8256/ https://dx.doi.org/10.4230/lipics.isaac.2017.35
|
|
BASE
|
|
Hide details
|
|
11 |
Space-Time Trade-Offs for the Shortest Unique Substring Problem
|
|
Ganguly, Arnab; Hon, Wing-Kai; Shah, Rahul. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 27th International Symposium on Algorithms and Computation (ISAAC 2016), 2016
|
|
BASE
|
|
Show details
|
|
13 |
Forbidden Extension Queries
|
|
Biswas, Sudip; Ganguly, Arnab; Shah, Rahul. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. : LIPIcs - Leibniz International Proceedings in Informatics. 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015), 2015
|
|
BASE
|
|
Show details
|
|
|
|