Marina Barsky

According to our database, Marina Barsky authored at least 14 papers between 2006 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Suffix Rank: a new scalable algorithm for indexing large string collections.

Marina Barsky, Jonathan Gabor, Mariano P. Consens, Alex Thomo

Proc. VLDB Endow., 2020

2015

K-Core Decomposition of Large Networks on a Single PC.

Wissam Khaouid, Marina Barsky, S. Venkatesh, Alex Thomo

Proc. VLDB Endow., 2015

2011

Full-Text (Substring) Indexes in External Memory

Marina Barsky, Ulrike Stege, Alex Thomo

Synthesis Lectures on Data Management, Morgan & Claypool Publishers, ISBN: 978-3-031-01885-5, 2011

Mining Flipping Correlations from Large Datasets with Taxonomies.

Marina Barsky, Sangkyum Kim, Tim Weninger, Jiawei Han

Proc. VLDB Endow., 2011

Suffix trees for inputs larger than main memory.

Marina Barsky, Ulrike Stege, Alex Thomo

Inf. Syst., 2011

Efficient Mining of Top Correlated Patterns Based on Null-Invariant Measures.

Sangkyum Kim, Marina Barsky, Jiawei Han

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2011

2010

Suffix trees for very large inputs.

Marina Barsky

PhD thesis, 2010

A survey of practical algorithms for suffix tree construction in external memory.

Marina Barsky, Ulrike Stege, Alex Thomo

Softw. Pract. Exp., 2010

Online update of b-trees.

Marina Barsky, Alex Thomo, Zoltan Toth, Calisto Zuzarte

Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009

Suffix trees for very large genomic sequences.

Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton

Proceedings of the 18th ACM Conference on Information and Knowledge Management, 2009

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

A new method for indexing genomes using on-disk suffix trees.

Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton

Proceedings of the 17th ACM Conference on Information and Knowledge Management, 2008

2007

Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings.

Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton

Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007

2006

A New Algorithm for Fast All-Against-All Substring Matching.

Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upton

Proceedings of the String Processing and Information Retrieval, 2006