Marina Barsky

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