| 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 | 238 | 2015 |
| 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 | 48 | 2009 |
| 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 | 43 | 2008 |
| Mining flipping correlations from large datasets with taxonomies M Barsky, S Kim, T Weninger, J Han arXiv preprint arXiv:1201.0233, 2011 | 39 | 2011 |
| Efficient mining of top correlated patterns based on null-invariant measures S Kim, M Barsky, J Han Machine Learning and Knowledge Discovery in Databases: European Conference …, 2011 | 34 | 2011 |
| 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 | 28 | 2010 |
| Suffix trees for inputs larger than main memory M Barsky, U Stege, A Thomo Information Systems 36 (3), 644-654, 2011 | 20 | 2011 |
| 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 | 6 | 2007 |
| 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-9, 2014 | 5 | 2014 |
| 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 | 5 | 2008 |
| Full-text (substring) indexes in external memory M Barsky, A Thomo, U Stege Morgan & Claypool Publishers, 2011 | 4 | 2011 |
| 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, 2010 | 4 | 2010 |
| Online update of b-trees M Barsky, A Thomo, Z Toth, C Zuzarte Proceedings of the 19th ACM international conference on Information and …, 2010 | 3 | 2010 |
| A new algorithm for fast all-against-all substring matching M Barsky, U Stege, A Thomo, C Upton String Processing and Information Retrieval: 13th International Conference …, 2006 | 2 | 2006 |
| Structures for indexing substrings M Barsky, U Stege, A Thomo Full-Text (Substring) Indexes in External Memory, 1-15, 2012 | 1 | 2012 |
| Suffix trees for very large inputs M Barsky | 1 | 2010 |
| All-against-all approximate substring matching M Barsky | 1 | 2006 |
| 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 |
| External Construction of Suffix Trees M Barsky, U Stege, A Thomo Full-Text (Substring) Indexes in External Memory, 17-41, 2012 | | 2012 |
| Scaling Up: When the Input Exceeds the Main Memory M Barsky, U Stege, A Thomo Full-Text (Substring) Indexes in External Memory, 43-53, 2012 | | 2012 |
