Jerzy Tiuryn

111 papers A* 14B 16C 1Misc 3Journal 55Unranked 21
YearRankTypeTitle / Venue / Authors
2024 J jnl
Phylogenetic network-assisted rooting of unrooted gene trees.
J. Comb. Optim.
Jerzy Tiuryn, Natalia Rutecka, Pawel Górecki
2022 Misc conf
Rooting Gene Trees via Phylogenetic Networks.
COCOON
Jerzy Tiuryn, Natalia Rutecka, Pawel Górecki
2021 J jnl
The Unconstrained Diameters of the Duplication-Loss Cost and the Loss Cost.
IEEE ACM Trans. Comput. Biol. Bioinform.
Pawel Górecki, Oliver Eulenstein, Jerzy Tiuryn
2020 J jnl
Minimizing genomic duplication episodes.
Comput. Biol. Chem.
Jaroslaw Paszek, Jerzy Tiuryn, Pawel Górecki
2019 J jnl
Learning signaling networks from combinatorial perturbations by exploiting siRNA off-target effects.
Bioinform.
Jerzy Tiuryn, Ewa Szczurek
2017 J jnl
FastBill: An Improved Tool for Prediction of Cis-Regulatory Modules.
J. Comput. Biol.
Bartek Wilczynski, Jerzy Tiuryn
2016 J jnl
Enhanceosome transcription factors preferentially dimerize with high mobility group proteins.
BMC Syst. Biol.
Aleksander Jankowski, Paulina Obara, Utsav Mathur, Jerzy Tiuryn
2016 J jnl
Romulus: robust multi-state identification of transcription factor binding sites from DNase-seq data.
Bioinform.
Aleksander Jankowski, Jerzy Tiuryn, Shyam Prabhakar
2014 J jnl
eCAMBer: efficient support for large-scale comparative analysis of multiple bacterial strains.
BMC Bioinform.
Michal Wozniak, Limsoon Wong, Jerzy Tiuryn
2013 J jnl
A Probabilistic Model of Neutral and Selective Dynamics of Protein Network Evolution.
J. Comput. Biol.
Janusz Dutkowski, Jerzy Tiuryn
2013 J jnl
Bioinformatics and Computational Biology in Poland.
PLoS Comput. Biol.
Janusz M. Bujnicki, Jerzy Tiuryn
2013 J jnl
Unrooted Tree Reconciliation: A Unified Approach.
IEEE ACM Trans. Comput. Biol. Bioinform.
Pawel Górecki, Oliver Eulenstein, Jerzy Tiuryn
2012 — conf
Inferring Evolutionary Scenarios in the Duplication, Loss and Horizontal Gene Transfer Model.
Logic and Program Semantics
Pawel Górecki, Jerzy Tiuryn
2011 J jnl
Bi-Billboard: Symmetrization and Careful Choice of Informant Species Results in Higher Accuracy of Regulatory Element Prediction.
J. Comput. Biol.
Norbert Dojer, Przemyslaw Biecek, Jerzy Tiuryn
2011 J jnl
CAMBerVis: visualization software to support comparative analysis of multiple bacterial strains.
Bioinform.
Michal Wozniak, Limsoon Wong, Jerzy Tiuryn
2011 J jnl
Deregulation upon DNA damage revealed by joint analysis of context-specific perturbation data.
BMC Bioinform.
Ewa Szczurek, Florian Markowetz, Irit Gat-Viks, Przemyslaw Biecek, Jerzy Tiuryn, Martin Vingron
2010 — conf
CAMBer: An approach to support comparative analysis of multiple bacterial strains.
BIBM
Michal Wozniak, Limsoon Wong, Jerzy Tiuryn
2010 J jnl
Introducing Knowledge into Differential Expression Analysis.
J. Comput. Biol.
Ewa Szczurek, Przemyslaw Biecek, Jerzy Tiuryn, Martin Vingron
2010 J jnl
MODEVO: exploring modularity and evolution of protein interaction networks.
Bioinform.
Michal Wozniak, Jerzy Tiuryn, Janusz Dutkowski
2009 J jnl
Finding evolutionarily conserved cis-regulatory modules with a universal set of motifs.
BMC Bioinform.
Bartek Wilczynski, Norbert Dojer, Mateusz Patelak, Jerzy Tiuryn
2009 J jnl
Phylogeny-guided interaction mapping in seven eukaryotes.
BMC Bioinform.
Janusz Dutkowski, Jerzy Tiuryn
2007 J jnl
A new approach to the assessment of the quality of predictions of transcription factor binding sites.
J. Biomed. Informatics
Szymon Nowakowski, Jerzy Tiuryn
2007 J jnl
Evolution of Gene Families Based on Gene Duplication, Loss, Accumulated Change, and Innovation.
J. Comput. Biol.
Damian Wójtowicz, Jerzy Tiuryn
2007 — conf
Identification of functional modules from conserved ancestral protein-protein interactions.
ISMB/ECCB (Supplement of Bioinformatics)
Janusz Dutkowski, Jerzy Tiuryn
2007 J jnl
Inferring phylogeny from whole genomes.
Bioinform.
Pawel Górecki, Jerzy Tiuryn
2007 — conf
Reconstruction of Mammalian Cell Cycle Regulatory Network from Microarray Data Using Stochastic Logical Networks.
CMSB
Bartek Wilczynski, Jerzy Tiuryn
2007 J jnl
URec: a system for unrooted reconciliation.
Bioinform.
Pawel Górecki, Jerzy Tiuryn
2006 J jnl
Alignment with Context Dependent Scoring Function.
J. Comput. Biol.
Anna Gambin, Jerzy Tiuryn, Jerzy Tyszkiewicz
2006 J jnl
Applying dynamic Bayesian networks to perturbed gene expression data.
BMC Bioinform.
Norbert Dojer, Anna Gambin, Andrzej Mizera, Bartek Wilczynski, Jerzy Tiuryn
2006 J jnl
DLS-trees: A model of evolutionary scenarios.
Theor. Comput. Sci.
Pawel Górecki, Jerzy Tiuryn
2006 — conf
On Genome Evolution with Accumulated Change and Innovation.
Comparative Genomics
Damian Wójtowicz, Jerzy Tiuryn
2006 B conf
On Genome Evolution with Innovation.
MFCS
Damian Wójtowicz, Jerzy Tiuryn
2006 — conf
Regulatory Network Reconstruction Using Stochastic Logical Networks.
CMSB
Bartek Wilczynski, Jerzy Tiuryn
2006 J jnl
Using local gene expression similarities to discover regulatory binding site modules.
BMC Bioinform.
Bartek Wilczynski, Torgeir R. Hvidsten, Andriy Kryshtafovych, Jerzy Tiuryn, Henryk Jan Komorowski, Krzysztof Fidelis
2005 Misc conf
Introducing Dependencies into Alignment Analysis and Its Use for Local Structure Prediction in Proteins.
PPAM
Szymon Nowakowski, Krzysztof Fidelis, Jerzy Tiuryn
2004 B conf
A Case Study of Genome Evolution: From Continuous to Discrete Time Model.
MFCS
Jerzy Tiuryn, Ryszard Rudnicki, Damian Wójtowicz
2004 — conf
On the Structure of Reconciliations.
Comparative Genomics
Pawel Górecki, Jerzy Tiuryn
2003 J jnl
Substructural logic and partial correctness.
ACM Trans. Comput. Log.
Dexter Kozen, Jerzy Tiuryn
2003 — conf
Type Inference for Nested Self Types.
TYPES
Viviana Bono, Jerzy Tiuryn, Pawel Urzyczyn
2002 C conf
Contextual alignment of biological sequences.
ECCB
Anna Gambin, Slawomir Lasota, Radoslaw Szklarczyk, Jerzy Tiuryn, Jerzy Tyszkiewicz
2002 J jnl
Products and Polymorphic Subtypes.
Fundam. Informaticae
Viviana Bono, Jerzy Tiuryn
2002 J jnl
The Subtyping Problem for Second-Order Types Is Undecidable.
Inf. Comput.
Jerzy Tiuryn, Pawel Urzyczyn
2001 J jnl
A Sequent Calculus for Subtyping Polymorphic Types.
Inf. Comput.
Jerzy Tiuryn
2001 J jnl
Dynamic logic.
SIGACT News
David Harel, Dexter Kozen, Jerzy Tiuryn
2001 A* conf
Intuitionistic Linear Logic and Partial Correctness.
LICS
Dexter Kozen, Jerzy Tiuryn
2001 J jnl
On the completeness of propositional Hoare logic.
Inf. Sci.
Dexter Kozen, Jerzy Tiuryn
2000 B ed.
Foundations of Software Science and Computation Structures, Third International Conference, FOSSACS 2000, Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000, Berlin, Germany, March 25 - April 2, 2000, Proceedings
FoSSaCS
Jerzy Tiuryn
2000 — conf
On the Completeness of Propositional Hoare Logic.
RelMiCS
Dexter Kozen, Jerzy Tiuryn
1999 J jnl
Alpha-Conversion and Typability.
Inf. Comput.
A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn
1999 J jnl
Discrimination by Parallel Observers: The Algorithm.
Inf. Comput.
Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn
1999 B conf
Type Reconstruction for Functional Programs with Subtyping over a Lattice of Atomic Types.
MFCS
Jerzy Tiuryn
1997 A* conf
Discrimination by Parallel Observers.
LICS
Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn
1997 — conf
Subtyping over a Lattice (Abstract).
Kurt Gödel Colloquium
Jerzy Tiuryn
1996 B conf
A Sequent Calculus for Subtyping Polymorphic Types.
MFCS
Jerzy Tiuryn
1996 J jnl
Satisfiability of Inequalities in a Poset.
Fundam. Informaticae
Vaughan R. Pratt, Jerzy Tiuryn
1996 A* conf
The Subtyping Problem for Second-Order Types is Undecidable.
LICS
Jerzy Tiuryn, Pawel Urzyczyn
1996 — conf
Untyped Lambda-Calculus with Input-Output.
CAAP
Jerzy Tiuryn, Mitchell Wand
1995 B ed.
Computer Science Logic, 8th International Workshop, CSL '94, Kazimierz, Poland, September 25-30, 1994, Selected Papers
CSL
Leszek Pacholski, Jerzy Tiuryn
1995 — conf
Equational Axiomatization of Bicoercibility for Polymorphic Types.
FSTTCS
Jerzy Tiuryn
1994 J jnl
An Analysis of ML Typability.
J. ACM
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1993 — conf
A New Characterization of Lambda Definability.
TLCA
Achim Jung, Jerzy Tiuryn
1993 J jnl
The Undecidability of the Semi-unification Problem
Inf. Comput.
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1993 J jnl
Type Reconstruction in the Presence of Polymorphic Recursion.
ACM Trans. Program. Lang. Syst.
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1993 — conf
Type Reconstruction with Recursive Types and Atomic Subtyping.
TAPSOFT
Jerzy Tiuryn, Mitchell Wand
1992 J jnl
On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures.
Theor. Comput. Sci.
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1992 Misc conf
Solving Equational Constraints in Polymorphic Types.
LFCS
Jerzy Tiuryn
1992 A* conf
Subtype Inequalities
LICS
Jerzy Tiuryn
1992 J jnl
Type Reconstruction in Finite Rank Fragments of the Second-Order lambda-Calculus
Inf. Comput.
A. J. Kfoury, Jerzy Tiuryn
1990 J jnl
Fixed Points in Free Process Algebras, Part II.
Theor. Comput. Sci.
Jerzy Tiuryn, David B. Benson
1990 — ch.
Logics of Programs.
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B)
Dexter Kozen, Jerzy Tiuryn
1990 — conf
ML Typability is DEXTIME-Complete.
CAAP
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1990 A* conf
The Undecidability of the Semi-Unification Problem (Preliminary Report)
STOC
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1990 B conf
Type Inference Problems: A Survey.
MFCS
Jerzy Tiuryn
1990 A* conf
Type Reconstruction in Finite-Rank Fragments of the Polymorphic lambda-Calculus (Extended Summary)
LICS
A. J. Kfoury, Jerzy Tiuryn
1989 J jnl
A Simplified Proof of DDL < DL
Inf. Comput.
Jerzy Tiuryn
1989 A* conf
Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report)
LICS
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1989 J jnl
Fixed Points in Free Process Algebras, Part I.
Theor. Comput. Sci.
David B. Benson, Jerzy Tiuryn
1988 A* conf
A Proper Extension of ML with an Effective Type-Assignment.
POPL
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1988 A* conf
On the Computational Power of Universally Polymorphic Recursion
LICS
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1988 J jnl
Some Relationships Between Logics of Programs and Complexity Theory.
Theor. Comput. Sci.
Jerzy Tiuryn, Pawel Urzyczyn
1987 A* conf
The Hierarchy of Finitely Typed Functional Programs (Short Version)
LICS
A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn
1986 B conf
Higher-Order Arrays and Stacks in Programming. An Application of Complexity Theory to Logics of Programs.
MFCS
Jerzy Tiuryn
1985 B conf
Fixed Ponts in Process Algebras with Internal Actions ( a preliminary note).
Mathematical Foundations of Programming Semantics
David B. Benson, Jerzy Tiuryn
1985 J jnl
Preface
Inf. Control.
Jerzy Tiuryn
1984 J jnl
Equivalences among Logics of Programs.
J. Comput. Syst. Sci.
Albert R. Meyer, Jerzy Tiuryn
1984 B conf
Remarks on Comparing Expressive Power of Logics of Programs.
MFCS
Jerzy Tiuryn, Pawel Urzyczyn
1984 J jnl
Unbounded Program Memory Adds to the Expressive Power of First-Order Programming Logic
Inf. Control.
Jerzy Tiuryn
1983 — conf
Implicit definability of finite binary trees by sets of equations.
Logic and Machines
Jerzy Tiuryn
1983 — conf
PC-Compactness, a Necessary Condition for the Existence of Sound and Complete Logics of Partial Correctness.
Logic of Programs
Jan A. Bergstra, Jerzy Tiuryn
1983 A* conf
Some Relationships between Logics of Programs and Complexity Theory (Extended Abstract)
FOCS
Jerzy Tiuryn, Pawel Urzyczyn
1982 J jnl
Another Incompleteness Result for Hoare's Logic
Inf. Control.
Jan A. Bergstra, Anna Chmielinska, Jerzy Tiuryn
1982 J jnl
Floyds Principle, Correctness Theories and Program Equivalence.
Theor. Comput. Sci.
Jan A. Bergstra, Jerzy Tiuryn, John V. Tucker
1982 A* conf
On the Power of Nondeterminism in Dynamic Logic.
ICALP
Piotr Berman, Joseph Y. Halpern, Jerzy Tiuryn
1981 — conf
A Note On Equivalences Among Logics of Programs.
Logic of Programs
Albert R. Meyer, Jerzy Tiuryn
1981 J jnl
Algorithmic degrees of algebraic structures.
Fundam. Informaticae
Jan A. Bergstra, Jerzy Tiuryn
1981 — conf
Hoare's Logic is Incomplete When It Does Not Have To Be.
Logic of Programs
Jan A. Bergstra, Anna Chmielinska, Jerzy Tiuryn
1981 J jnl
Logic of effective definitions.
Fundam. Informaticae
Jan A. Bergstra, Jerzy Tiuryn
1981 J jnl
Logic of effective definitions.
Fundam. Informaticae
Jerzy Tiuryn
1981 J jnl
Regular extensions of iterative algebras and metric interpretations.
Fundam. Informaticae
Jan A. Bergstra, Jerzy Tiuryn
1981 A* conf
Unbounded Program Memory Adds to the Expressive Power of First-Order Dynamic Logic (Extended Abstract)
FOCS
Jerzy Tiuryn
1980 — conf
Regular extensions of iterative algebras and metric interpretations.
CLAAP
Jan A. Bergstra, Jerzy Tiuryn
1980 J jnl
Unique Fixed Points Vs. Least Fixed Points.
Theor. Comput. Sci.
Jerzy Tiuryn
1979 — conf
A Survey of the Logic of Effective Definitions.
Logic of Programs
Jerzy Tiuryn
1979 B conf
Fixed Points in the Power-Set Algebra of Infinite Trees (Abstract).
MFCS
Jerzy Tiuryn
1979 B conf
Implicit definability of algebraic structures by means of program properties.
FCT
Jan A. Bergstra, Jerzy Tiuryn
1979 A* conf
Unique Fixed Points v. Least Fixed Points.
ICALP
Jerzy Tiuryn
1978 J jnl
Some Results on the Decomposition of Finite Automata
Inf. Control.
Jerzy Tiuryn
1977 B conf
Fixed-Points and Algebras with Infinitely Long Expressions, I.
MFCS
Jerzy Tiuryn
1977 B conf
Fixed-Points and Algebras with Infinitely Long Expressions, II.
FCT
Jerzy Tiuryn
1976 B conf
On the Domain of Iteration in Iterative Algebraic Theories.
MFCS
Jerzy Tiuryn
1974 B conf
The Algebraic Approach to the Theory of Computing Systems.
MFCS
Jerzy Tiuryn