Professor Dina Sokol

Department of Computer and Information Science

Brooklyn College of the City University of NY

The Graduate Center of the City University of NY

Publications

Journal Papers:

  1. A. Amir, E. Kondratovsky, S. Marcus, and D. Sokol. Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets. Submitted to Theory of Computing Systems 2025 .

  2. S. Marcus, D. Sokol, S. Zelikovitz. Exact and Inexact Search for 2d Side-Sharing Tandems. Accepted for publication in TCS 2025 .

  3. A. Amir, E. Kondratovsky, G. M. Landau, S. Marcus, D. Sokol. Reconstructing parameterized strings from parameterized suffix and LCP arrays. Theor. Comput. Sci. 981: 114230 (2024)

  4. A. Amir, A. Butman, G. M. Landau, S. Marcus, and D. Sokol. Double String Tandem Repeats. Algorithmica 85(1): 170-187 (2023). https://doi.org/10.1007/s00453-022-01016-9

  5. A. Amir, A. Butman, E. Kondratovsky, A. Levy and D. Sokol. Multidimensional Period Recovery. Algorithmica (2022). https://doi.org/10.1007/s00453-022-00926-y

  6. D. Sokol. 2-Dimensional Palindromes with k Mismatches. Information Processing Letters (2020) https://doi.org/10.1016/j.ipl.2020.106019

  7. A. Amir, G. M. Landau, S. Marcus, and D. Sokol. Two-dimensional maximal repetitions. Theoretical Computer Science (812), 49-61, 2020.

  8. S. H. Geizhals and D. Sokol. Finding Maximal 2-dimensional Palindromes. Information and Computation, Volume 266, Pages 161-172, 2019.

  9. A. Amir, M. Amit, G. M. Landau, and D. Sokol. Period Recovery of Strings over the Hamming and Edit Distances. Theoretical Computer Science, (710), 2-18, 2018.

  10. M. Amit, M. Crochemore, G.M. Landau, and D. Sokol. Locating Maximal Approximate Runs in a String. Theoretical Computer Science (700), 45-62, 2017.

  11. S. Marcus and D. Sokol. 2D Lyndon Words and Applications. Algorithmica 77 (1), 116-133, 2017.

  12. D. Sokol and J. Tojeira. Speeding up the Detection of Tandem Repeats over the Edit Distance. Theoretical Computer Science (2013), http://dx.doi.org/10.1016/j.tcs.2013.04.021

  13. S. Neuburger and D. Sokol. Succinct 2D Dictionary Matching. Algorithmica, DOI: 10.1007/s00453-012-9615-9), February 2012. URL to article

  14. Y. Liang, D. Sokol, S. Zelikovitz and S. I. Levitan (2012). Classification of Tandem Repeats in the Human Genome. International Journal of Knowledge Discovery in Bioinformatics, 3(3), 1-21.

  15. D. Sokol and F. Atagun. TRedD: A Database for Tandem Repeats over the Edit Distance. Database (2010); 2010: article ID baq003, 10.1093/database/baq003. URL to article

  16. D. Sokol, F. Adkins, Z. Che, and K. Pfabe. Finding Repeats Within Strings. DIMACS Educational Module Series 09-2, 2009. URL to article     URL to module list

  17. G. Kucherov and D. Sokol. Approximate Tandem Repeats. Encyclopedia of Algorithms, 2008.

  18. D. Sokol, G. Benson, and J. Tojeira. Tandem Repeats over the Edit Distance. Bioinformatics 2007 23(2): e30-e35 URL to article.

  19. A. Amir, G. M. Landau, M. Lewenstein and D. Sokol. Dynamic Text and Static Pattern Matching. ACM Transactions on Algorithms, 3(2), 2007.

  20. C. Harel, M. Lewenstein and D. Sokol. Approximate Parameterized Matching. ACM Transactions on Algorithms, 3(3), 2007.

  21. A. Amir, G. M. Landau and D. Sokol. Inplace 2-Dimensional Matching in Compressed Images. Journal of Algorithms, 49, 2, p. 240-261, 2003.

  22. A. Amir, G. M. Landau and D. Sokol. Inplace Run-Length 2-Dimensional Compressed Search. Theoretical Computer Science, 290, 3, p. 1361--1383, 2003.

  23. G. M. Landau, J. P. Schmidt and D. Sokol. An Algorithm for Approximate Tandem Repeats. Journal of Computational Biology, Volume 8, p. 1-18, 2001.

Conference Proceedings:

  1. A Amir, E Kondratovsky, S Marcus, D Sokol. Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets. International Symposium on String Processing and Information Retrieval, 1-15, 2024.

  2. S. Marcus, D. Sokol, S. Zelikovitz. 2d Side-Sharing Tandems with Mismatches. International Symposium on String Processing and Information Retrieval, 306-320, 2024.

  3. S. Marcus, D. Sokol, S. Zelikovitz. Runs of Side-Sharing Tandems in Rectangular Arrays. SISAP 2023: 88-102

  4. Amihood Amir, Concettina Guerra, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol. Reconstructing Parameterized Strings from Parameterized Suffix and LCP Arrays. SPIRE 2022: 55-69.

  5. A. Amir, A. Butman, E. Kondratovsky, A. Levy and D. Sokol. Multidimensional Period Recovery. 27th International Symposium on String Processing and Information Retrieval, SPIRE 2020: 115-130.

  6. A. Amir, A. Butman, G. M. Landau, S. Marcus, and D. Sokol. Double String Tandem Repeats. 31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020: 3:1-3:13.

  7. A. Amir, G.M. Landau, S. Marcus, and D. Sokol. Two-Dimensional Maximal Repetitions, LIPIcs-Leibniz International Proceedings in Informatics 112, pages 2:1--2:14, 26th Annual European Symposium on Algorithms (ESA) 2018.

  8. A. Amir, M. Amit, G.M. Landau, and D. Sokol. Period Recovery over the Hamming and Edit Distances, Latin American Symposium on Theoretical Informatics, pages 55-67, 2016.

  9. S. Geizhals and D. Sokol. Finding Maximal 2-Dimensional Palindromes. LIPIcs-Leibniz International Proceedings in Informatics: 54, pages 19:1--19:12, 27th Annual Symposium on Combinatorial Pattern Matching CPM 2016.

  10. S. Marcus and D. Sokol. On 2D Lyndon Words. International Symposium on String Processing and Information Retrieval SPIRE 2013, pages 206-217.

  11. Y. Liang, D. Sokol, and S. Zelikovitz. Clustering Tandem Repeats via Trinucleotides. In proceedings of IEEE International Conference on Data Mining, Workshop on Biological Data Mining, pages 64-71, IEEE Computer Society, 2012.

  12. S. Neuburger and D. Sokol. Succinct 2D Dictionary Matching with No Slowdown. Proc. 18th International Workshop on Algorithms and Data Structures (WADS), Lecture Notes in Computer Science, Springer-Verlag, p. 619-630, 2011.

  13. S. Neuburger and D. Sokol. Small-space 2d Dictionary Matching. In Proceedings of the 21st Combinatorial Pattern Matching Conference, NYU-Poly, NY, 6129: 27-39, 2010.

  14. D. Sokol and R. Rakhamimov. TandemGraph: A Graphical Tool for Modeling String Regularities. Proceedings of BIOCOMP '09: International Conference on Bioinformatics & Computational Biology, 536-540. (Las Vegas, NV), 2009.

  15. D. Sokol, G. Benson, and J. Tojeira. Tandem Repeats over the Edit Distance. Presented at the 5th European Conference on Computational Biology, ECCB 2006.

  16. D. Sokol and J. Tojeira. Filtering Tandem Repeats in DNA Sequences. Proceedings of BIOCOMP '06: International Conference on Bioinformatics & Computational Biology, (Las Vegas, NV), 2006.

  17. C. Harel, M. Lewenstein and D. Sokol. Approximate Parameterized Matching. Proceedings of ESA 2004: 12th Annual European Symposium on Algorithms, p. 414, 2004.

  18. A. Amir, G. M. Landau and D. Sokol. Inplace 2-D Matching in Compressed Images. Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, 2003.

  19. A. Amir, G. M. Landau, M. Lewenstein and D. Sokol. Dynamic Text and Static Pattern Matching. Workshop on Algorithms and Data Structures, WADS 2003, pages 340-352.

  20. A. Amir, G. M. Landau and D. Sokol. Inplace Run-Length 2-Dimensional Compressed Search. Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000.