A New Algorithm for Fast All-Against-All Substring Matching. - Marina Barsky; Ulrike Stege; Alex Thomo; Chris Upton (SPIRE, 2006)

Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings. - Marina Barsky; Ulrike Stege; Alex Thomo; Chris Upton (BIBE, 2007)

A new method for indexing genomes using on-disk suffix trees. - Marina Barsky; Ulrike Stege; Alex Thomo; Chris Upton (CIKM, 2008)

A graph approach to the threshold all-against-all substring matching problem. - Marina Barsky; Ulrike Stege; Alex Thomo; Chris Upton (ACM J. Exp. Algorithmics, 2008)

Suffix trees for very large genomic sequences. - Marina Barsky; Ulrike Stege; Alex Thomo; Chris Upton (CIKM, 2009)

Online update of b-trees. - Marina Barsky; Alex Thomo; Zoltan Toth; Calisto Zuzarte (CIKM, 2010)

A survey of practical algorithms for suffix tree construction in external memory. - Marina Barsky; Ulrike Stege; Alex Thomo (Softw. Pract. Exp., 2010)

Suffix trees for very large inputs. - Marina Barsky (2010)

Efficient Mining of Top Correlated Patterns Based on Null-Invariant Measures. - Sangkyum Kim; Marina Barsky; Jiawei Han 001 (ECML/PKDD (2), 2011)

Suffix trees for inputs larger than main memory. - Marina Barsky; Ulrike Stege; Alex Thomo (Inf. Syst., 2011)

Mining Flipping Correlations from Large Datasets with Taxonomies. - Marina Barsky; Sangkyum Kim; Tim Weninger; Jiawei Han 001 (Proc. VLDB Endow., 2011)

Full-Text (Substring) Indexes in External Memory - Marina Barsky; Ulrike Stege; Alex Thomo (Morgan & Claypool Publishers, 2011)

K-Core Decomposition of Large Networks on a Single PC. - Wissam Khaouid; Marina Barsky; S. Venkatesh 001; Alex Thomo (Proc. VLDB Endow., 2015)

Suffix Rank: a new scalable algorithm for indexing large string collections. - Marina Barsky; Jonathan Gabor; Mariano P. Consens; Alex Thomo (Proc. VLDB Endow., 2020)