A Comparison of Empirical Tree Entropies

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SPIRE (27. : 2020 : Orlando, Fla.; Online) String processing and information retrieval
1. Verfasser: Hucke, Danny (VerfasserIn)
Weitere Verfasser: Lohrey, Markus (VerfasserIn), Benkner, Louisa Seelbach (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2020
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Multidimensional Period Recovery 2020 Amir, Amihood
A Comparison of Empirical Tree Entropies 2020 Hucke, Danny
Efficient Enumeration of Distinct Factors Using Package Representations 2020 Charalampopoulos, Panagiotis
Practical Random Access to SLP-Compressed Texts 2020 Gagie, Travis
Towards Efficient Interactive Computation of Dynamic Time Warping Distance 2020 Nishi, Akihiro
Approximating the Anticover of a String 2020 Amir, Amihood
Adaptive Exact Learning in a Mixed-Up World: Dealing with Periodicity, Errors and Jumbled-Index Queries in String Reconstruction 2020 Afshar, Ramtin
Pre-indexing Pruning Strategies 2020 Altin, Soner
Measuring Controversy in Social Networks Through NLP 2020 Zarate, Juan Manuel Ortiz de
Tailoring r-index for Document Listing Towards Metagenomics Applications 2020 Cobas, Dustin
Efficient Construction of Hierarchical Overlap Graphs 2020 Park, Sung Gwan
Computing Covers Under Substring Consistent Equivalence Relations 2020 Kikuchi, Natsumi
On Repetitiveness Measures of Thue-Morse Words 2020 Kutsukake, Kanaru
Contextual Pattern Matching 2020 Navarro, Gonzalo
Navigating Forest Straight-Line Programs in Constant Time 2020 Reh, Carl Philipp
An Efficient Elastic-Degenerate Text Index? Not Likely 2020 Gibney, Daniel
Smaller Fully-Functional Bidirectional BWT Indexes 2020 Belazzougui, Djamal
Relative Lempel-Ziv Compression of Suffix Arrays 2020 Puglisi, Simon J.
Internal Quasiperiod Queries 2020 Crochemore, Maxime
Longest Square Subsequence Problem Revisited 2020 Inoue, Takafumi
Alle Artikel auflisten