Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPawel Górecki 0001
Person information
- affiliation: University of Warsaw, Department of Mathematics, Informatics, and Mechanics, Poland
Other persons with the same name
- Pawel Górecki 0002
![[0000-0001-5544-2373]](https://dblp1.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-5544-2373")
— Gdynia Maritime University, Department of Marine Electronics, Poland - Pawel Górecki 0003 — Ocado Technology, Wroclaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j28]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)- [j27]Sanket Wagle, Alexey Markin, Pawel Górecki, Tavis K. Anderson, Oliver Eulenstein:
Asymmetric Cluster-Based Measures for Comparative Phylogenetics. J. Comput. Biol. 31(4): 312-327 (2024) - 2022
- [j26]Marcin Wawerka, Dawid Dabkowski, Natalia Rutecka, Agnieszka Mykowiecka, Pawel Górecki:
Embedding gene trees into phylogenetic networks by conflict resolution algorithms. Algorithms Mol. Biol. 17(1): 11 (2022) - 2021
- [j25]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) - [j24]Pawel Tabaszewski, Pawel Górecki, Alexey Markin, Tavis K. Anderson, Oliver Eulenstein:
Consensus of All Solutions for Intractable Phylogenetic Tree Inference. IEEE ACM Trans. Comput. Biol. Bioinform. 18(1): 149-161 (2021) - [j23]Pawel Górecki, Oliver Eulenstein, Jerzy Tiuryn:
The Unconstrained Diameters of the Duplication-Loss Cost and the Loss Cost. IEEE ACM Trans. Comput. Biol. Bioinform. 18(6): 2125-2135 (2021) - 2020
- [j22]Jaroslaw Paszek, Jerzy Tiuryn, Pawel Górecki:
Minimizing genomic duplication episodes. Comput. Biol. Chem. 89: 107260 (2020) - 2019
- [j21]Pawel Górecki, Agnieszka Mykowiecka, Jaroslaw Paszek, Oliver Eulenstein:
Mathematical properties of the gene duplication cost. Discret. Appl. Math. 258: 114-122 (2019) - [j20]Agnieszka Mykowiecka, Pawel Górecki:
Credibility of Evolutionary Events in Gene Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 16(3): 713-726 (2019) - 2018
- [j19]Michal Aleksander Ciach, Anna Muszewska, Pawel Górecki:
Locus-aware decomposition of gene trees with respect to polytomous species trees. Algorithms Mol. Biol. 13(1): 11:1-11:18 (2018) - [j18]Dawid Dabkowski, Pawel Tabaszewski, Pawel Górecki:
Minimizing the deep coalescence cost. J. Bioinform. Comput. Biol. 16(5): 1840021:1-1840021:18 (2018) - [j17]Jaroslaw Paszek, Pawel Górecki:
Efficient Algorithms for Genomic Duplication Models. IEEE ACM Trans. Comput. Biol. Bioinform. 15(5): 1515-1524 (2018) - [j16]Agnieszka Mykowiecka, Pawel Szczesny, Pawel Górecki:
Inferring Gene-Species Assignments in the Presence of Horizontal Gene Transfer. IEEE ACM Trans. Comput. Biol. Bioinform. 15(5): 1571-1578 (2018) - [j15]Pawel Górecki, Oliver Eulenstein:
Bijective Diameters of Gene Tree Parsimony Costs. IEEE ACM Trans. Comput. Biol. Bioinform. 15(5): 1723-1727 (2018) - 2017
- [j14]Pawel Górecki, Jaroslaw Paszek, Oliver Eulenstein:
Unconstrained Diameters for Deep Coalescence. IEEE ACM Trans. Comput. Biol. Bioinform. 14(5): 1002-1012 (2017) - 2016
- [j13]Jaroslaw Paszek, Pawel Górecki:
Genomic duplication problems for unrooted gene trees. BMC Genom. 17(S-1): 15 (2016) - 2015
- [j12]Pawel Górecki, Oliver Eulenstein:
Gene Tree Diameter for Deep Coalescence. IEEE ACM Trans. Comput. Biol. Bioinform. 12(1): 155-165 (2015) - 2014
- [j11]Pawel Górecki, Oliver Eulenstein:
Refining discordant gene trees. BMC Bioinform. 15(S-13): S3 (2014) - [j10]Pawel Górecki, Oliver Eulenstein:
DrML: Probabilistic Modeling of Gene Duplications. J. Comput. Biol. 21(1): 89-98 (2014) - [j9]Pawel Górecki, Oliver Eulenstein:
Maximizing Deep Coalescence Cost. IEEE ACM Trans. Comput. Biol. Bioinform. 11(1): 231-242 (2014) - 2013
- [j8]Wen-Chieh Chang, Pawel Górecki, Oliver Eulenstein:
Exact solutions for species Tree Inference from discordant gene Trees. J. Bioinform. Comput. Biol. 11(5) (2013) - [j7]Pawel Górecki, Oliver Eulenstein, Jerzy Tiuryn:
Unrooted Tree Reconciliation: A Unified Approach. IEEE ACM Trans. Comput. Biol. Bioinform. 10(2): 522-536 (2013) - 2012
- [j6]Pawel Górecki, Oliver Eulenstein:
Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem. BMC Bioinform. 13(S-10): S14 (2012) - 2011
- [j5]Pawel Górecki, J. Gordon Burleigh, Oliver Eulenstein:
Maximum likelihood models and algorithms for gene tree evolution with duplications and losses. BMC Bioinform. 12(S-1): S15 (2011) - 2010
- [j4]Pawel Górecki:
H-trees: a Model of Evolutionary Scenarios with Horizontal Gene Transfer. Fundam. Informaticae 103(1-4): 105-128 (2010) - 2007
- [j3]Pawel Górecki, Jerzy Tiuryn:
Inferring phylogeny from whole genomes. Bioinform. 23(2): 116-122 (2007) - [j2]Pawel Górecki, Jerzy Tiuryn:
URec: a system for unrooted reconciliation. Bioinform. 23(4): 511-512 (2007) - 2006
- [j1]Pawel Górecki, Jerzy Tiuryn:
DLS-trees: A model of evolutionary scenarios. Theor. Comput. Sci. 359(1-3): 378-399 (2006)
Conference and Workshop Papers
- 2023
- [c26]Sanket Wagle, Alexey Markin, Pawel Górecki, Tavis K. Anderson, Oliver Eulenstein:
The Asymmetric Cluster Affinity Cost. RECOMB-CG 2023: 131-145 - [c25]Pawel Górecki, Natalia Rutecka, Agnieszka Mykowiecka, Jaroslaw Paszek:
Simultaneous Reconstruction of Duplication Episodes and Gene-Species Mappings. WABI 2023: 6:1-6:18 - 2022
- [c24]Jerzy Tiuryn, Natalia Rutecka, Pawel Górecki:
Rooting Gene Trees via Phylogenetic Networks. COCOON 2022: 419-431 - [c23]Alvin Chon, Pawel Górecki, Oliver Eulenstein, Xiaoqiu Huang, Ali Jannesari:
Scalable and Extensible Robinson-Foulds for Comparative Phylogenetics. IPDPS Workshops 2022: 166-175 - 2021
- [c22]Jaroslaw Paszek, Oliver Eulenstein, Pawel Górecki:
Novel genomic duplication models through integer linear programming. BCB 2021: 16:1-16:11 - [c21]Marcin Wawerka, Dawid Dabkowski, Natalia Rutecka, Agnieszka Mykowiecka, Pawel Górecki:
Conflict Resolution Algorithms for Deep Coalescence Phylogenetic Networks. WABI 2021: 17:1-17:21 - 2020
- [c20]Javad Ansarifar, Alexey Markin, Pawel Górecki, Oliver Eulenstein:
Integer Linear Programming Formulation for the Unified Duplication-Loss-Coalescence Model. ISBRA 2020: 229-242 - 2019
- [c19]Pawel Górecki, Alexey Markin, Oliver Eulenstein:
Feasibility Algorithms for the Duplication-Loss Cost. COCOON 2019: 206-218 - 2018
- [c18]Pawel Tabaszewski, Pawel Górecki, Oliver Eulenstein:
Phylogenetic Consensus for Exact Median Trees. BCB 2018: 366-375 - [c17]Agnieszka Mykowiecka, Anna Muszewska, Pawel Górecki:
Inferring time-consistent and well-supported horizontal gene transfers. BIBM 2018: 79-83 - [c16]Pawel Górecki, Alexey Markin, Oliver Eulenstein:
Cophenetic Distances: A Near-Linear Time Algorithmic Framework. COCOON 2018: 168-179 - 2017
- [c15]Pawel Górecki, Alexey Markin, Agnieszka Mykowiecka, Jaroslaw Paszek, Oliver Eulenstein:
Phylogenetic Tree Reconciliation: Mean Values for Fixed Gene Trees. ISBRA 2017: 234-245 - [c14]Jaroslaw Paszek, Pawel Górecki:
New Algorithms for the Genomic Duplication Problem. RECOMB-CG 2017: 101-115 - [c13]Michal Aleksander Ciach, Anna Muszewska, Pawel Górecki:
Detecting Locus Acquisition Events in Gene Trees. WABI 2017: 5:1-5:13 - 2016
- [c12]Agnieszka Mykowiecka, Pawel Górecki:
Bootstrapping Algorithms for Gene Duplication and Speciation Events. AlCoB 2016: 106-118 - [c11]Pawel Górecki, Jaroslaw Paszek, Agnieszka Mykowiecka:
Mean Values of Gene Duplication and Loss Cost Functions. ISBRA 2016: 189-199 - 2015
- [c10]Arkadiusz Betkier, Pawel Szczesny, Pawel Górecki:
Fast Algorithms for Inferring Gene-Species Associations. ISBRA 2015: 36-47 - 2014
- [c9]Pawel Górecki, Jaroslaw Paszek, Oliver Eulenstein:
Unconstrained gene tree diameters for deep coalescence. BCB 2014: 114-121 - [c8]Pawel Górecki, Jaroslaw Paszek, Oliver Eulenstein:
Duplication Cost Diameters. ISBRA 2014: 212-223 - 2012
- [c7]Pawel Górecki, Jerzy Tiuryn:
Inferring Evolutionary Scenarios in the Duplication, Loss and Horizontal Gene Transfer Model. Logic and Program Semantics 2012: 83-105 - [c6]Pawel Górecki, Oliver Eulenstein:
Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms. COCOON 2012: 531-542 - [c5]Pawel Górecki, J. Gordon Burleigh, Oliver Eulenstein:
GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches. ISBRA 2012: 102-114 - [c4]Pawel Górecki, Oliver Eulenstein:
A Robinson-Foulds Measure to Compare Unrooted Trees with Rooted Trees. ISBRA 2012: 115-126 - 2011
- [c3]Pawel Górecki, Oliver Eulenstein:
A Linear Time Algorithm for Error-Corrected Reconciliation of Unrooted Gene Trees. ISBRA 2011: 148-159 - 2004
- [c2]Pawel Górecki, Jerzy Tiuryn:
On the Structure of Reconciliations. Comparative Genomics 2004: 42-54 - [c1]Pawel Górecki:
Reconciliation problems for duplication, loss and horizontal gene transfer. RECOMB 2004: 316-325
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-05-03 22:24 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:
