![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Yair Horesh
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
- [j6]Yehezkel S. Resheff
, Yair Horesh
, Moni Shahar:
Proving unfairness of decision making systems without model access. Expert Syst. Appl. 213(Part): 118987 (2023) - 2009
- [j5]Yair Horesh
, Ydo Wexler, Ilana Lebenthal, Michal Ziv-Ukelson, Ron Unger:
RNAslider: a faster engine for consecutive windows folding and its application to the analysis of genomic folding asymmetry. BMC Bioinform. 10 (2009) - 2008
- [j4]Inna Myslyuk, Tirza Doniger
, Yair Horesh
, Avraham Hury, Ran Hoffer, Yaara Ziporen, Shulamit Michaeli, Ron Unger:
Psiscan: a computational approach to identify H/ACA-like and AGA-like non-coding RNA in trypanosomatid genomes. BMC Bioinform. 9 (2008) - 2007
- [j3]Yair Horesh
, Tirza Doniger
, Shulamit Michaeli, Ron Unger:
RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules. BMC Bioinform. 8 (2007) - 2006
- [j2]Yair Horesh
, Ramit Mehr, Ron Unger:
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees. J. Comput. Biol. 13(6): 1165-1176 (2006) - 2005
- [j1]Yair Horesh
, Ron Unger:
A bottom-up clustering algorithm to detect ncRNA molecules with a common secondary structure. Int. J. Bioinform. Res. Appl. 1(3): 292-304 (2005)
Conference and Workshop Papers
- 2024
- [c4]Aviv Ben-Arie, Daniel Deutch, Nave Frost, Yair Horesh, Idan Meyuhas:
Optimizing Counterfactual-based Analysis of Machine Learning Models Through Databases. EDBT 2024: 597-609 - 2022
- [c3]Idan Meyuhas, Aviv Ben-Arie, Yair Horesh
, Daniel Deutch:
CFDB: Machine Learning Model Analysis via Databases of CounterFactuals. SIGMOD Conference 2022: 2401-2404 - 2019
- [c2]Yair Horesh
, Noa Haas, Elhanan Mishraky, Yehezkel S. Resheff, Shir Meir Lador:
Paired-Consistency: An Example-Based Model-Agnostic Approach to Fairness Regularization in Machine Learning. PKDD/ECML Workshops (1) 2019: 590-604 - 2003
- [c1]Yair Horesh, Amihood Amir, Shulamit Michaeli, Ron Unger:
A rapid method for detection of putative RNAi target genes in genomic data. ECCB 2003: 73-80
Informal and Other Publications
- 2019
- [i2]Yair Horesh, Noa Haas, Elhanan Mishraky, Yehezkel S. Resheff, Shir Meir Lador:
Paired-Consistency: An Example-Based Model-Agnostic Approach to Fairness Regularization in Machine Learning. CoRR abs/1908.02641 (2019) - 2018
- [i1]Noa Haas, Yair Horesh, Shimon Shahar, Yehezkel S. Resheff:
Identifying Financial Institutions by Transaction Signatures. CoRR abs/1808.00151 (2018)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
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-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint