default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJaroslaw Paszek
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Pawel Górecki, Natalia Rutecka, Agnieszka Mykowiecka, Jaroslaw Paszek:
Unifying duplication episode clustering and gene-species mapping inference. Algorithms Mol. Biol. 19(1): 7 (2024)- [c8]Natalia Rutecka
, Agnieszka Mykowiecka, Jaroslaw Paszek, Pawel Górecki:
Robinson-Foulds distance between phylogenetic networks and gene trees. BCB 2024: 7:1-7:10 - 2023
- [c7]Pawel Górecki, Natalia Rutecka, Agnieszka Mykowiecka, Jaroslaw Paszek:
Simultaneous Reconstruction of Duplication Episodes and Gene-Species Mappings. WABI 2023: 6:1-6:18 - 2021
- [j6]Jaroslaw Paszek, Alexey Markin, Pawel Górecki, Oliver Eulenstein:
Taming the Duplication-Loss-Coalescence Model with Integer Linear Programming. J. Comput. Biol. 28(8): 758-773 (2021) - [c6]Jaroslaw Paszek, Oliver Eulenstein, Pawel Górecki:
Novel genomic duplication models through integer linear programming. BCB 2021: 16:1-16:11 - 2020
- [j5]Jaroslaw Paszek, Jerzy Tiuryn, Pawel Górecki:
Minimizing genomic duplication episodes. Comput. Biol. Chem. 89: 107260 (2020)
2010 – 2019
- 2019
- [j4]Pawel Górecki, Agnieszka Mykowiecka, Jaroslaw Paszek, Oliver Eulenstein:
Mathematical properties of the gene duplication cost. Discret. Appl. Math. 258: 114-122 (2019) - 2018
- [j3]Jaroslaw Paszek, Pawel Górecki:
Efficient Algorithms for Genomic Duplication Models. IEEE ACM Trans. Comput. Biol. Bioinform. 15(5): 1515-1524 (2018) - 2017
- [j2]Pawel Górecki, Jaroslaw Paszek, Oliver Eulenstein:
Unconstrained Diameters for Deep Coalescence. IEEE ACM Trans. Comput. Biol. Bioinform. 14(5): 1002-1012 (2017) - [c5]Pawel Górecki, Alexey Markin, Agnieszka Mykowiecka, Jaroslaw Paszek, Oliver Eulenstein:
Phylogenetic Tree Reconciliation: Mean Values for Fixed Gene Trees. ISBRA 2017: 234-245 - [c4]Jaroslaw Paszek, Pawel Górecki:
New Algorithms for the Genomic Duplication Problem. RECOMB-CG 2017: 101-115 - 2016
- [j1]Jaroslaw Paszek, Pawel Górecki:
Genomic duplication problems for unrooted gene trees. BMC Genom. 17(S-1): 15 (2016) - [c3]Pawel Górecki, Jaroslaw Paszek, Agnieszka Mykowiecka:
Mean Values of Gene Duplication and Loss Cost Functions. ISBRA 2016: 189-199 - 2014
- [c2]Pawel Górecki, Jaroslaw Paszek, Oliver Eulenstein:
Unconstrained gene tree diameters for deep coalescence. BCB 2014: 114-121 - [c1]Pawel Górecki, Jaroslaw Paszek, Oliver Eulenstein:
Duplication Cost Diameters. ISBRA 2014: 212-223
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 2025-03-04 22:34 CET 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:
