Treffer 1 - 20 von 3.043

1

I/O-efficient data structures for non-overlapping indexing
Hooshmand, Sahar ; Abedin, Paniz ; Oğuzhan Külekci, M. ; et al.
In Theoretical Computer Science 12 February 2021 857:1-7

Fachzeitschrift
Merkliste
2

Non-overlapping indexing in BWT-runs bounded space
Gibney, Daniel ; MacNichol, Paul ; Thankachan, Sharma V.
In Theoretical Computer Science 21 November 2025 1056

Fachzeitschrift
Merkliste
3

Suffix sorting via matching statistics
Zsuzsanna Lipták ; Francesco Masillo ; Simon J. Puglisi
Algorithms for Molecular Biology, Vol 19, Iss 1, Pp 1-18 (2024)

Generalized suffix array Matching statistics String collections Compressed representatio... Data structures Efficient algorithms
Fachzeitschrift
Merkliste
4

Search Data Structures for Skewed Strings
Experimental and efficient algorithms

Crescenzi, P. ; Grossi, R. ; Italiano, G. F.
LECTURE NOTES IN COMPUTER SCIENCE. :81-96

Konferenz
Merkliste
5

An Efficient String Matching Algorithm Using Bidirectional and Parallel Processing Structure for Intrusion Detection System.
Gwo-Ching Chang ; Yue-Der Lin
KSII Transactions on Internet & Information Systems. Oct2010, Vol. 4 Issue 5, p956-967. 12p. 4 Diagrams, 1 Chart, 2 Graphs.

Algorithms Intrusion detection syst... Parallel processing Data structures Keywords Internet
Fachzeitschrift
Merkliste
6

Space-efficient indexes for forbidden extension queries
Biswas, Sudip ; Ganguly, Arnab ; Shah, Rahul ; et al.
In Journal of Discrete Algorithms May 2018 50:23-35

Fachzeitschrift
Merkliste
7

Dieses Ergebnis kann Gästen nicht angezeigt werden.

8

Practical Algorithmic Techniques for Several String Processing Problems
Andreica, Mugurel Ionut ; Tapus, Nicolae
Proceedings of the 8th RoEduNet International Conference, pp. 136-141, Galati, Romania, 3-4 December, 2009. (ISBN: 978-606-8085-15-9)

Computer Science - Data... Computer Science - Forma... F.2.2 F.1.1
Report
Merkliste
9

Deterministic sub-linear space LCE data structures with efficient construction
Tanimura, Yuka ; I, Tomohiro ; Bannai, Hideo ; et al.

Computer Science - Data...
Report
Merkliste
10

Compressed Dictionary Matching on Run-Length Encoded Strings
Bille, Philip ; Gørtz, Inge Li ; Puglisi, Simon J. ; et al.
36th Annual Symposium on Combinatorial Pattern Matching (CPM 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 331, pp. 21:1-21:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2025)

Data Structures and Algo...
Report
Merkliste
11

siEDM: an efficient string index and search algorithm for edit distance with moves
Takabatake, Yoshimasa ; Nakashima, Kenta ; Kuboyama, Tetsuji ; et al.

Computer Science - Data...
Report
Merkliste
12

Communication-Efficient String Sorting
Bingmann, Timo ; Sanders, Peter ; Schimek, Matthias

Computer Science - Distr... Computer Science - Data...
Report
Merkliste
13

An invertible transform for efficient string matching in labeled digraphs
Nellore, Abhinav ; Nguyen, Austin ; Thompson, Reid F.
CPM 2021

Computer Science - Data...
Report
Merkliste
14

Efficient Computation of Periods and Covers Using Sampling
Lecroq, Thierry ; Marino, Francesco Pio

Computer Science - Data...
Report
Merkliste
15

A framework for space-efficient string kernels
Belazzougui, Djamal ; Cunial, Fabio

Computer Science - Data...
Report
Merkliste
16

Space-Efficient String Indexing for Wildcard Pattern Matching
Lewenstein, Moshe ; Nekrich, Yakov ; Vitter, Jeffrey Scott

Computer Science - Data...
Report
Merkliste
17

Compact representation of maximal palindromes
Mieno, Takuya

Data Structures and Algo...
Report
Merkliste
18

Palindromic trees for a sliding window and its applications
Mieno, Takuya ; Watanabe, Kiichi ; Nakashima, Yuto ; et al.
In Information Processing Letters January 2022 173

Fachzeitschrift
Merkliste
19

LCP-Aware Parallel String Sorting
Ellert, Jonas ; Fischer, Johannes ; Sitchinava, Nodari

Computer Science - Data... Computer Science - Distr...
Report
Merkliste
20

Dieses Ergebnis kann Gästen nicht angezeigt werden.


Filter