 | 2012 |
|---|
| 12 |       | Marina Barsky,
Sangkyum Kim,
Tim Weninger,
Jiawei Han:
Mining Flipping Correlations from Large Datasets with Taxonomies
CoRR abs/1201.0233: (2012) |
| 2011 |
|---|
| 11 | | Marina Barsky,
Ulrike Stege,
Alex Thomo:
Full-Text (Substring) Indexes in External Memory
Morgan & Claypool Publishers 2011 |
| 10 | | Sangkyum Kim,
Marina Barsky,
Jiawei Han:
Efficient Mining of Top Correlated Patterns Based on Null-Invariant Measures.
ECML/PKDD (2) 2011: 177-192 |
| 9 | | Marina Barsky,
Ulrike Stege,
Alex Thomo:
Suffix trees for inputs larger than main memory.
Inf. Syst. 36(3): 644-654 (2011) |
| 8 | | Marina Barsky,
Sangkyum Kim,
Tim Weninger,
Jiawei Han:
Mining Flipping Correlations from Large Datasets with Taxonomies.
PVLDB 5(4): 370-381 (2011) |
| 2010 |
|---|
| 7 | | Marina Barsky,
Alex Thomo,
Zoltan Toth,
Calisto Zuzarte:
Online update of b-trees.
CIKM 2010: 149-158 |
| 6 | | Marina Barsky,
Ulrike Stege,
Alex Thomo:
A survey of practical algorithms for suffix tree construction in external memory.
Softw., Pract. Exper. 40(11): 965-988 (2010) |
| 2009 |
|---|
| 5 | | Marina Barsky,
Ulrike Stege,
Alex Thomo,
Chris Upton:
Suffix trees for very large genomic sequences.
CIKM 2009: 1417-1420 |
| 2008 |
|---|
| 4 | | Marina Barsky,
Ulrike Stege,
Alex Thomo,
Chris Upton:
A new method for indexing genomes using on-disk suffix trees.
CIKM 2008: 649-658 |
| 3 | | Marina Barsky,
Ulrike Stege,
Alex Thomo,
Chris Upton:
A graph approach to the threshold all-against-all substring matching problem.
ACM Journal of Experimental Algorithmics 12: (2008) |
| 2007 |
|---|
| 2 | | Marina Barsky,
Ulrike Stege,
Alex Thomo,
Chris Upton:
Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings.
BIBE 2007: 327-333 |
| 2006 |
|---|
| 1 | | Marina Barsky,
Ulrike Stege,
Alex Thomo,
Chris Upton:
A New Algorithm for Fast All-Against-All Substring Matching.
SPIRE 2006: 360-366 |
Data released under the ODC-BY 1.0 license — See also our legal information page