Follow
Marina Barsky
Marina Barsky
Posdoc UIUC
Verified email at uvic.ca
Title
Cited by
Cited by
Year
K-core decomposition of large networks on a single PC
W Khaouid, M Barsky, V Srinivasan, A Thomo
Proceedings of the VLDB Endowment 9 (1), 13-23, 2015
1702015
Suffix trees for very large genomic sequences
M Barsky, U Stege, A Thomo, C Upton
Proceedings of the 18th ACM conference on Information and knowledge …, 2009
432009
A new method for indexing genomes using on-disk suffix trees
M Barsky, U Stege, A Thomo, C Upton
Proceedings of the 17th ACM conference on Information and knowledge …, 2008
422008
Mining flipping correlations from large datasets with taxonomies
M Barsky, S Kim, T Weninger, J Han
arXiv preprint arXiv:1201.0233, 2011
362011
Efficient mining of top correlated patterns based on null-invariant measures
S Kim, M Barsky, J Han
Joint European Conference on Machine Learning and Knowledge Discovery in …, 2011
262011
A survey of practical algorithms for suffix tree construction in external memory
M Barsky, U Stege, A Thomo
Software: Practice and Experience 40 (11), 965-988, 2010
242010
Suffix trees for inputs larger than main memory
M Barsky, U Stege, A Thomo
Information Systems 36 (3), 644-654, 2011
192011
Full-text (substring) indexes in external memory
M Barsky, U Stege, A Thomo
Synthesis Lectures on Data Management 3 (7), 1-92, 2011
52011
A graph approach to the threshold all-against-all substring matching problem
M Barsky, U Stege, A Thomo, C Upton
Journal of Experimental Algorithmics (JEA) 12, 1-26, 2008
52008
Shortest path approaches for the longest common subsequence of a set of strings
M Barsky, U Stege, A Thomo, C Upton
2007 IEEE 7th International Symposium on BioInformatics and BioEngineering …, 2007
52007
Suffix tree searcher: exploration of common substrings in large DNA sequence sets
D Minkley, MJ Whitney, SH Lin, MG Barsky, C Kelly, C Upton
BMC research notes 7 (1), 1-9, 2014
42014
Online update of b-trees
M Barsky, A Thomo, Z Toth, C Zuzarte
Proceedings of the 19th ACM international conference on Information and …, 2010
32010
JaPaFi: a novel program for the identification of highly conserved DNA sequences
A Sadeque, M Barsky, F Marass, P Kruczkiewicz, C Upton
Viruses 2 (9), 1867-1885, 2010
32010
A new algorithm for fast all-against-all substring matching
M Barsky, U Stege, A Thomo, C Upton
International Symposium on String Processing and Information Retrieval, 360-366, 2006
22006
Suffix trees for very large inputs
M Barsky
12010
All-against-all approximate substring matching
M Barsky
12006
Suffix Rank: a new scalable algorithm for indexing large string collections
M Barsky, J Gabor, MP Consens, A Thomo
Proceedings of the VLDB Endowment 13 (12), 2787-2800, 2020
2020
JaPaFi: A Novel Program for the Identification of Highly Conserved DNA Sequences
C Upton, P Kruczkiewicz, F Marass, M Barsky, A Sadeque
Viruses, 2010
2010
New Implementation for the Multi-sequence All-Against-All Substring Matching Problem
O Sandu
2007
The system can't perform the operation now. Try again later.
Articles 1–19