default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDina Sokol
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Amihood Amir, Eitan Kondratovsky, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Reconstructing parameterized strings from parameterized suffix and LCP arrays. Theor. Comput. Sci. 981: 114230 (2024)- [c19]Amihood Amir
, Eitan Kondratovsky, Shoshana Marcus, Dina Sokol:
Linear Time Reconstruction of Parameterized Strings from Parameterized Suffix and LCP Arrays for Constant-Sized Alphabets. SPIRE 2024: 1-15 - [c18]Shoshana Marcus, Dina Sokol, Sarah Zelikovitz:
2d Side-Sharing Tandems with Mismatches. SPIRE 2024: 306-320 - 2023
- [j18]Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Double String Tandem Repeats. Algorithmica 85(1): 170-187 (2023) - [c17]Shoshana Marcus, Dina Sokol, Sarah Zelikovitz:
Runs of Side-Sharing Tandems in Rectangular Arrays. SISAP 2023: 88-102 - 2022
- [j17]Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol:
Multidimensional Period Recovery. Algorithmica 84(6): 1490-1510 (2022) - [c16]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 - 2020
- [j16]Dina Sokol:
2-Dimensional palindromes with k mismatches. Inf. Process. Lett. 164: 106019 (2020) - [j15]Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Two-dimensional maximal repetitions. Theor. Comput. Sci. 812: 49-61 (2020) - [c15]Amihood Amir, Ayelet Butman, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Double String Tandem Repeats. CPM 2020: 3:1-3:13 - [c14]Amihood Amir, Ayelet Butman, Eitan Kondratovsky, Avivit Levy, Dina Sokol:
Multidimensional Period Recovery. SPIRE 2020: 115-130 - [i4]Dina Sokol:
2-Dimensional Palindromes with k Mismatches. CoRR abs/2002.11157 (2020)
2010 – 2019
- 2019
- [j14]Sara H. Geizhals, Dina Sokol:
Finding maximal 2-dimensional palindromes. Inf. Comput. 266: 161-172 (2019) - 2018
- [j13]Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol:
Period recovery of strings over the Hamming and edit distances. Theor. Comput. Sci. 710: 2-18 (2018) - [c13]Amihood Amir, Gad M. Landau, Shoshana Marcus, Dina Sokol:
Two-Dimensional Maximal Repetitions. ESA 2018: 2:1-2:14 - 2017
- [j12]Shoshana Marcus, Dina Sokol:
2D Lyndon Words and Applications. Algorithmica 77(1): 116-133 (2017) - [j11]Mika Amit, Maxime Crochemore, Gad M. Landau, Dina Sokol:
Locating maximal approximate runs in a string. Theor. Comput. Sci. 700: 45-62 (2017) - 2016
- [c12]Sara H. Geizhals, Dina Sokol:
Finding Maximal 2-Dimensional Palindromes. CPM 2016: 19:1-19:12 - [c11]Amihood Amir, Mika Amit, Gad M. Landau, Dina Sokol:
Period Recovery over the Hamming and Edit Distances. LATIN 2016: 55-67 - [r2]Gregory Kucherov, Dina Sokol:
Approximate Tandem Repeats. Encyclopedia of Algorithms 2016: 106-109 - 2014
- [j10]Dina Sokol, Justin Tojeira:
Speeding up the detection of tandem repeats over the edit distance. Theor. Comput. Sci. 525: 103-110 (2014) - 2013
- [j9]Shoshana Neuburger, Dina Sokol:
Succinct 2D Dictionary Matching. Algorithmica 65(3): 662-684 (2013) - [c10]Shoshana Marcus, Dina Sokol:
On Two-Dimensional Lyndon Words. SPIRE 2013: 206-217 - [i3]Shoshana Marcus, Dina Sokol:
2D Lyndon Words and Applications. CoRR abs/1301.0103 (2013) - [i2]Shoshana Marcus, Dina Sokol:
Engineering Small Space Dictionary Matching. CoRR abs/1301.6428 (2013) - [i1]Shoshana Marcus, Dina Sokol:
Dynamic 2D Dictionary Matching in Small Space. CoRR abs/1302.0072 (2013) - 2012
- [j8]Yupu Liang, Dina Sokol, Sarah Zelikovitz, Sarah Ita Levitan:
Classification of Tandem Repeats in the Human Genome. Int. J. Knowl. Discov. Bioinform. 3(3): 1-21 (2012) - [c9]Yupu Liang, Dina Sokol, Sarah Zelikovitz:
Clustering Tandem Repeats via Trinucleotides. ICDM Workshops 2012: 64-71 - 2011
- [c8]Shoshana Neuburger, Dina Sokol:
Succinct 2D Dictionary Matching with No Slowdown. WADS 2011: 619-630 - 2010
- [j7]Dina Sokol, Firat Atagun:
TRedD - A database for tandem repeats over the edit distance. Database J. Biol. Databases Curation 2010 (2010) - [c7]Shoshana Neuburger, Dina Sokol:
Small-Space 2D Compressed Dictionary Matching. CPM 2010: 27-39
2000 – 2009
- 2009
- [c6]Dina Sokol, Ramin Rakhamimov:
TandemGraph: A Graphical Tool for Modeling String Regularities. BIOCOMP 2009: 536-540 - 2008
- [r1]Gregory Kucherov, Dina Sokol:
Approximate Tandem Repeats. Encyclopedia of Algorithms 2008 - 2007
- [j6]Dina Sokol, Gary Benson, Justin Tojeira:
Tandem repeats over the edit distance. Bioinform. 23(2): 30-35 (2007) - [j5]Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol:
Dynamic text and static pattern matching. ACM Trans. Algorithms 3(2): 19 (2007) - [j4]Carmit Hazay, Moshe Lewenstein, Dina Sokol:
Approximate parameterized matching. ACM Trans. Algorithms 3(3): 29 (2007) - 2006
- [c5]Dina Sokol, Justin Tojeira:
Filtering Tandem Repeats in DNA Sequences. BIOCOMP 2006: 161-167 - 2004
- [c4]Carmit Hazay, Moshe Lewenstein, Dina Sokol:
Approximate Parameterized Matching. ESA 2004: 414-425 - 2003
- [j3]Amihood Amir, Gad M. Landau, Dina Sokol:
Inplace 2D matching in compressed images. J. Algorithms 49(2): 240-261 (2003) - [j2]Amihood Amir, Gad M. Landau, Dina Sokol:
Inplace run-length 2d compressed search. Theor. Comput. Sci. 290(3): 1361-1383 (2003) - [c3]Amihood Amir, Gad M. Landau, Dina Sokol:
Inplace 2D matching in compressed images. SODA 2003: 853-862 - [c2]Amihood Amir, Gad M. Landau, Moshe Lewenstein, Dina Sokol:
Dynamic Text and Static Pattern Matching. WADS 2003: 340-352 - 2001
- [j1]Gad M. Landau, Jeanette P. Schmidt, Dina Sokol:
An Algorithm for Approximate Tandem Repeats. J. Comput. Biol. 8(1): 1-18 (2001) - 2000
- [c1]Amihood Amir, Gad M. Landau, Dina Sokol:
Inplace run-length 2d compressed search. SODA 2000: 817-818
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
