scispace - formally typeset
Search or ask a question
Institution

University of Warsaw

EducationWarsaw, Poland
About: University of Warsaw is a education organization based out in Warsaw, Poland. It is known for research contribution in the topics: Population & Large Hadron Collider. The organization has 20832 authors who have published 56617 publications receiving 1185084 citations. The organization is also known as: Uniwersytet Warszawski & Warsaw University.


Papers
More filters
Journal ArticleDOI
TL;DR: This protocol was extensively tested over the largest dataset of non-redundant protein–peptide interactions available to date (including bound and unbound docking cases) and obtained models with high or medium accuracy (sufficient for practical applications).
Abstract: Protein-peptide interactions play a key role in cell functions. Their structural characterization, though challenging, is important for the discovery of new drugs. The CABS-dock web server provides an interface for modeling protein-peptide interactions using a highly efficient protocol for the flexible docking of peptides to proteins. While other docking algorithms require pre-defined localization of the binding site, CABS-dock doesn't require such knowledge. Given a protein receptor structure and a peptide sequence (and starting from random conformations and positions of the peptide), CABS-dock performs simulation search for the binding site allowing for full flexibility of the peptide and small fluctuations of the receptor backbone. This protocol was extensively tested over the largest dataset of non-redundant protein-peptide interactions available to date (including bound and unbound docking cases). For over 80% of bound and unbound data set cases, we obtained models with high or medium accuracy (sufficient for practical applications). Additionally, as optional features, CABS-dock can exclude user-selected binding modes from docking search or to increase the level of flexibility for chosen receptor fragments. CABS-dock is freely available as a web server at this http URL

216 citations

Journal ArticleDOI
TL;DR: The BASECOL2012 database as mentioned in this paper is a repository of collisional data and a web service within the Virtual Atomic and Molecular Data Centre (VAMDC, http://www.vamdc.eu).
Abstract: The BASECOL2012 database is a repository of collisional data and a web service within the Virtual Atomic and Molecular Data Centre (VAMDC, http://www.vamdc.eu). It contains rate coefficients for the collisional excitation of rotational, ro-vibrational, vibrational, fine, and hyperfine levels of molecules by atoms, molecules, and electrons, as well as fine-structure excitation of some atoms that are relevant to interstellar and circumstellar astrophysical applications. Submissions of new published collisional rate coefficients sets are welcome, and they will be critically evaluated before inclusion in the database. In addition, BASECOL2012 provides spectroscopic data queried dynamically from various spectroscopic databases using the VAMDC technology. These spectroscopic data are conveniently matched to the in-house collisional excitation rate coefficients using the SPECTCOL sofware package (http:// vamdc.eu/software), and the combined sets of data can be downloaded from the BASECOL2012 website. As a partner of the VAMDC, BASECOL2012 is accessible from the general VAMDC portal (http://portal.vamdc.eu) and from user tools such as SPECTCOL.

216 citations

Journal ArticleDOI
TL;DR: This is the first algorithm providing a constant factor approximation for treewidth which runs in time single exponential in $k$ and linear in the input size and can be used to speed up many algorithms to work in time.
Abstract: We give an algorithm that for an input $n$-vertex graph $G$ and integer $k>0$, in time $2^{O(k)} n$, either outputs that the treewidth of $G$ is larger than $k$, or gives a tree decomposition of $G$ of width at most $5k+4$. This is the first algorithm providing a constant factor approximation for treewidth which runs in time single exponential in $k$ and linear in $n$. Treewidth-based computations are subroutines of numerous algorithms. Our algorithm can be used to speed up many such algorithms to work in time which is single exponential in the treewidth and linear in the input size.

215 citations

Journal ArticleDOI
Vardan Khachatryan1, Albert M. Sirunyan1, Armen Tumasyan1, Wolfgang Adam  +2122 moreInstitutions (140)
TL;DR: In this article, the normalized differential cross section for top quark pair (tt) production is measured in pp collisions at a centre-of-mass energy of 8TeV at the CERN LHC using the CMS detector in data corresponding to an integrated luminosity of 19.7fb^(−1).
Abstract: The normalized differential cross section for top quark pair (tt) production is measured in pp collisions at a centre-of-mass energy of 8TeV at the CERN LHC using the CMS detector in data corresponding to an integrated luminosity of 19.7fb^(−1). The measurements are performed in the lepton+jets (e/μ +jets) and in the dilepton (e^+e^−, μ^+μ^−, and e^±μ^∓) decay channels. The tt cross section is measured as a function of the kinematic properties of the charged leptons, the jets associated to b quarks, the top quarks, and the tt system. The data are compared with several predictions from perturbative quantum chromodynamic up to approximate next-to-next-to-leading-order precision. No significant deviations are observed relative to the standard model predictions.

215 citations

Journal ArticleDOI
TL;DR: In this article, a thorough investigation of the proper scheme to correct for basis set superposition errors is performed for the He dimer within the CEPA(1) method, and it is concluded that the full counterpoise correction should be applied rather than a scheme omitting the occupied orbit of the ghost.

214 citations


Authors

Showing all 21191 results

NameH-indexPapersCitations
Alexander Malakhov139148699556
Emmanuelle Perez138155099016
Piotr Zalewski135138889976
Krzysztof Doroba133144089029
Hector F. DeLuca133130369395
Krzysztof M. Gorski132380105912
Igor Golutvin131128288559
Jan Krolikowski131128983994
Michal Szleper130123882036
Anatoli Zarubin129120486435
Malgorzata Kazana129117581106
Artur Kalinowski129116281906
Predrag Milenovic129118581144
Marcin Konecki128117879392
Karol Bunkowski128119279455
Network Information
Related Institutions (5)
Centre national de la recherche scientifique
382.4K papers, 13.6M citations

90% related

University of Paris-Sud
52.7K papers, 2.1M citations

90% related

ETH Zurich
122.4K papers, 5.1M citations

90% related

École Normale Supérieure
99.4K papers, 3M citations

89% related

Max Planck Society
406.2K papers, 19.5M citations

89% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
2023176
2022619
20212,880
20203,208
20193,130
20183,164