Marina Barsky

Publication Activity (10 Years)

Years Active: 2006-2020
Publications (10 Years): 1

Top Topics

Data Mining Tasks

Data Analysis Tasks

Top Venues

Proc. VLDB Endow.

Publications

Marina Barsky, Jonathan Gabor, Mariano P. Consens, Alex Thomo
Suffix Rank: a new scalable algorithm for indexing large string collections. Proc. VLDB Endow. 13 (11) (2020)
Wissam Khaouid, Marina Barsky, S. Venkatesh, Alex Thomo
K-Core Decomposition of Large Networks on a Single PC. Proc. VLDB Endow. 9 (1) (2015)
Marina Barsky, Sangkyum Kim, Tim Weninger, Jiawei Han
Mining Flipping Correlations from Large Datasets with Taxonomies CoRR (2012)
Sangkyum Kim, Marina Barsky, Jiawei Han
Efficient Mining of Top Correlated Patterns Based on Null-Invariant Measures. ECML/PKDD (2) (2011)
Marina Barsky, Ulrike Stege, Alex Thomo
Suffix trees for inputs larger than main memory. Inf. Syst. 36 (3) (2011)
Marina Barsky, Sangkyum Kim, Tim Weninger, Jiawei Han
Mining Flipping Correlations from Large Datasets with Taxonomies. Proc. VLDB Endow. 5 (4) (2011)
Marina Barsky, Ulrike Stege, Alex Thomo
A survey of practical algorithms for suffix tree construction in external memory. Softw. Pract. Exp. 40 (11) (2010)
Marina Barsky, Alex Thomo, Zoltan Toth, Calisto Zuzarte
Online update of b-trees. CIKM (2010)
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton
Suffix trees for very large genomic sequences. CIKM (2009)
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton
A graph approach to the threshold all-against-all substring matching problem. ACM J. Exp. Algorithmics 12 (2008)
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton
A new method for indexing genomes using on-disk suffix trees. CIKM (2008)
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton
Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings. BIBE (2007)
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton
A New Algorithm for Fast All-Against-All Substring Matching. SPIRE (2006)