default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShay Zakov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c9]Yuichi Asahiro, Jesper Jansson
, Avraham A. Melkman, Eiji Miyano, Hirotaka Ono, Quan Xue, Shay Zakov:
Shortest Longest-Path Graph Orientations. COCOON (1) 2023: 141-154
2010 – 2019
- 2015
- [j9]Shay Zakov, Vineet Bafna:
Reconstructing Breakage Fusion Bridge Architectures Using Noisy Copy Numbers. J. Comput. Biol. 22(6): 577-594 (2015) - [c8]Roy Ronen, Glenn Tesler, Ali Akbari, Shay Zakov, Noah A. Rosenberg, Vineet Bafna:
Haplotype Allele Frequency (HAF) Score: Predicting Carriers of Ongoing Selective Sweeps Without Knowledge of the Adaptive Allele. RECOMB 2015: 276-280 - 2014
- [c7]Shay Zakov, Nimrod Milo, Tamar Pinhas, Sivan Yogev, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Dekel Tsur, Michal Ziv-Ukelson:
Recent Results on Three Problems in Comparative Structural RNAomics. CMSR@ECCB 2014: 58-58 - [c6]Shay Zakov, Vineet Bafna:
Reconstructing Breakage Fusion Bridge Architectures Using Noisy Copy Numbers. RECOMB 2014: 400-417 - 2013
- [j8]Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Michal Ziv-Ukelson:
Unrooted unordered homeomorphic subtree alignment of RNA trees. Algorithms Mol. Biol. 8: 13 (2013) - [j7]Tamar Pinhas, Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson:
Efficient edit distance with duplications and contractions. Algorithms Mol. Biol. 8: 27 (2013) - [j6]Christine Lo, Sangwoo Kim, Shay Zakov, Vineet Bafna:
Evaluating genome architecture of a complex region via generalized bipartite matching. BMC Bioinform. 14(S-5): S13 (2013) - [j5]Shay Zakov, Marcus Kinsella, Vineet Bafna:
An algorithmic approach for breakage-fusion-bridge detection in tumor genomes. Proc. Natl. Acad. Sci. USA 110(14): 5546-5551 (2013) - 2012
- [c5]Nimrod Milo, Shay Zakov, Erez Katzenelson, Eitan Bachmat, Yefim Dinitz, Michal Ziv-Ukelson:
RNA Tree Comparisons via Unrooted Unordered Alignments. WABI 2012: 135-148 - 2011
- [j4]Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson:
Reducing the worst case running times of a family of RNA and CFG problems, using Valiant's approach. Algorithms Mol. Biol. 6: 20 (2011) - [j3]Kfir Wolfson, Shay Zakov, Moshe Sipper, Michal Ziv-Ukelson:
Have your spaghetti and eat it too: evolutionary algorithmics and post-evolutionary analysis. Genet. Program. Evolvable Mach. 12(2): 121-160 (2011) - [j2]Shay Zakov, Yoav Goldberg, Michael Elhadad, Michal Ziv-Ukelson:
Rich Parameterization Improves RNA Structure Prediction. J. Comput. Biol. 18(11): 1525-1542 (2011) - [j1]Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson:
Sparse RNA folding: Time and space efficient algorithms. J. Discrete Algorithms 9(1): 12-31 (2011) - [c4]Tamar Pinhas, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson:
Edit Distance with Duplications and Contractions Revisited. CPM 2011: 441-454 - [c3]Shay Zakov, Yoav Goldberg, Michael Elhadad, Michal Ziv-Ukelson:
Rich Parameterization Improves RNA Structure Prediction. RECOMB 2011: 546-562 - 2010
- [c2]Shay Zakov, Dekel Tsur, Michal Ziv-Ukelson:
Reducing the Worst Case Running Times of a Family of RNA and CFG Problems, Using Valiant's Approach. WABI 2010: 65-77
2000 – 2009
- 2009
- [c1]Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson:
Sparse RNA Folding: Time and Space Efficient Algorithms. CPM 2009: 249-262
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-08-05 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:
