| 2009 |
|---|
| 45 | EE | Lars Arvestad,
Jens Lagergren,
Bengt Sennblad:
The gene evolution model and computing its associated probabilities.
J. ACM 56(2): (2009) |
| 44 | EE | Isaac Elias,
Jens Lagergren:
Fast neighbor joining.
Theor. Comput. Sci. 410(21-23): 1993-2000 (2009) |
| 2008 |
|---|
| 43 | | Keith A. Crandall,
Jens Lagergren:
Algorithms in Bioinformatics, 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings
Springer 2008 |
| 2007 |
|---|
| 42 | EE | Samuel A. Andersson,
Jens Lagergren:
Motif Yggdrasil: Sampling Sequence Motifs from a Tree Mixture Model.
Journal of Computational Biology 14(5): 682-697 (2007) |
| 2006 |
|---|
| 41 | EE | Samuel A. Andersson,
Jens Lagergren:
Motif Yggdrasil: Sampling from a Tree Mixture Model.
RECOMB 2006: 458-472 |
| 40 | EE | Marcus Hjelm,
Mattias Höglund,
Jens Lagergren:
New Probabilistic Network Models and Algorithms for Oncogenesis.
Journal of Computational Biology 13(4): 853-865 (2006) |
| 39 | EE | David Bryant,
Jens Lagergren:
Compatibility of unrooted phylogenetic trees is FPT.
Theor. Comput. Sci. 351(3): 296-302 (2006) |
| 2005 |
|---|
| 38 | | Jens Lagergren:
Comparative Genomics, RECOMB 2004 International Workshop, RCG 2004, Bertinoro, Italy, October 16-19, 2004, Revised Selected Papers
Springer 2005 |
| 37 | EE | Isaac Elias,
Jens Lagergren:
Fast Neighbor Joining.
ICALP 2005: 1263-1274 |
| 2004 |
|---|
| 36 | EE | Lars Arvestad,
Ann-Charlotte Berglund,
Jens Lagergren,
Bengt Sennblad:
Gene tree reconstruction and orthology analysis based on an integrated model for duplications and sequence evolution.
RECOMB 2004: 326-335 |
| 35 | EE | Michael T. Hallett,
Jens Lagergren,
Ali Tofigh:
Simultaneous identification of duplications and lateral transfers.
RECOMB 2004: 347-356 |
| 34 | EE | Louigi Addario-Berry,
Benny Chor,
Michael T. Hallett,
Jens Lagergren,
Alessandro Panconesi,
Todd Wareham:
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.
J. Bioinformatics and Computational Biology 2(2): 257-272 (2004) |
| 33 | | Wynand Alkema,
Öjvind Johansson,
Jens Lagergren,
Wyeth W. Wasserman:
MSCAN: identification of functional clusters of transcription factor binding sites.
Nucleic Acids Research 32(Web-Server-Issue): 195-198 (2004) |
| 32 | EE | Lars Ivansson,
Jens Lagergren:
Algorithms for RH Mapping: New Ideas and Improved Analysis.
SIAM J. Comput. 34(1): 89-108 (2004) |
| 2003 |
|---|
| 31 | EE | Öjvind Johansson,
Wynand Alkema,
Wyeth W. Wasserman,
Jens Lagergren:
Identification of functional clusters of transcription factor binding motifs in genome sequences: the MSCAN algorithm.
ISMB (Supplement of Bioinformatics) 2003: 169-176 |
| 30 | EE | Lars Arvestad,
Ann-Charlotte Berglund,
Jens Lagergren,
Bengt Sennblad:
Bayesian gene/species tree reconciliation and orthology analysis using MCMC.
ISMB (Supplement of Bioinformatics) 2003: 7-15 |
| 29 | EE | Louigi Addario-Berry,
Michael T. Hallett,
Jens Lagergren:
Towards Identifying Lateral Gene Transfer Events.
Pacific Symposium on Biocomputing 2003: 279-290 |
| 28 | EE | Louigi Addario-Berry,
Benny Chor,
Michael T. Hallett,
Jens Lagergren,
Alessandro Panconesi,
Todd Wareham:
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard.
WABI 2003: 202-215 |
| 27 | EE | Johan Håstad,
Lars Ivansson,
Jens Lagergren:
Fitting points on the real line and its application to RH mapping.
J. Algorithms 49(1): 42-62 (2003) |
| 26 | EE | David Fernández-Baca,
Jens Lagergren:
A Polynomial-Time Algorithm for Near-Perfect Phylogeny.
SIAM J. Comput. 32(5): 1115-1127 (2003) |
| 2002 |
|---|
| 25 | EE | Jens Lagergren:
Combining polynomial running time and fast convergence for the disk-covering method.
J. Comput. Syst. Sci. 65(3): 481-493 (2002) |
| 2001 |
|---|
| 24 | EE | Michael T. Hallett,
Jens Lagergren:
Efficient algorithms for lateral gene transfer problems.
RECOMB 2001: 149-156 |
| 2000 |
|---|
| 23 | EE | Michael T. Hallett,
Jens Lagergren:
Hunting for Functionally Analogous Genes.
FSTTCS 2000: 465-476 |
| 22 | EE | Michael T. Hallett,
Jens Lagergren:
New algorithms for the duplication-loss model.
RECOMB 2000: 138-146 |
| 1999 |
|---|
| 21 | | Jens Lagergren,
Peter Bro Miltersen:
Guest Editors' Foreword.
Nord. J. Comput. 6(2): 135-136 (1999) |
| 1998 |
|---|
| 20 | EE | Johan Håstad,
Lars Ivansson,
Jens Lagergren:
Fitting Points on the Real Line and Its Application to RH Mapping.
ESA 1998: 465-476 |
| 19 | EE | David Fernández-Baca,
Jens Lagergren:
On the Approximability of the Steiner Tree Problem in Phylogeny.
Discrete Applied Mathematics 88(1-3): 129-145 (1998) |
| 18 | EE | Viggo Kann,
Jens Lagergren,
Alessandro Panconesi:
Approximate Max k-Cut with Subgraph Guarantee.
Inf. Process. Lett. 65(3): 145-150 (1998) |
| 17 | EE | Jens Lagergren:
Upper Bounds on the Size of Obstructions and Intertwines.
J. Comb. Theory, Ser. B 73(1): 7-40 (1998) |
| 1997 |
|---|
| 16 | EE | Viggo Kann,
Sanjeev Khanna,
Jens Lagergren,
Alessandro Panconesi:
On the Hardness of Approximating Max k-Cut and its Dual.
Chicago J. Theor. Comput. Sci. 1997: (1997) |
| 1996 |
|---|
| 15 | | David Fernández-Baca,
Jens Lagergren:
A Polynomial-Time Algorithm for Near-Perfect Phylogeny.
ICALP 1996: 670-680 |
| 14 | | David Fernández-Baca,
Jens Lagergren:
On the Approximability of the Steiner Tree Problem in Phylogeny.
ISAAC 1996: 65-74 |
| 13 | | Viggo Kann,
Sanjeev Khanna,
Jens Lagergren,
Alessandro Panconesi:
On the Hardness of Approximating Max k-Cut and Its Dual.
ISTCS 1996: 61-67 |
| 12 | | Jens Lagergren:
Hypothesis Testing in Perfect Phylogeny for a Bounded Number of Characters.
STACS 1996: 605-616 |
| 11 | EE | Viggo Kann,
Jens Lagergren,
Alessandro Panconesi:
Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems.
Inf. Process. Lett. 58(3): 105-110 (1996) |
| 10 | | Jens Lagergren:
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width.
J. Algorithms 20(1): 20-44 (1996) |
| 9 | | Bruno Courcelle,
Jens Lagergren:
Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width.
Mathematical Structures in Computer Science 6(2): 141-165 (1996) |
| 1994 |
|---|
| 8 | | Jens Lagergren:
The Size of an Interwine.
ICALP 1994: 520-531 |
| 7 | EE | Jens Lagergren:
The Nonexistence of Reduction Rules Giving an Embedding into a K-tree.
Discrete Applied Mathematics 54(2-3): 219-223 (1994) |
| 1993 |
|---|
| 6 | | Bruno Courcelle,
Jens Lagergren:
Recognizable Sets of Graphs of Bounded Tree-Width.
Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 138-152 |
| 1991 |
|---|
| 5 | | Jens Lagergren:
An upper bound on the size of an obstruction.
Graph Structure Theory 1991: 601-622 |
| 4 | | Jens Lagergren,
Stefan Arnborg:
Finding Minimal Forbidden Minors Using a Finite Congruence.
ICALP 1991: 532-543 |
| 3 | | Stefan Arnborg,
Jens Lagergren,
Detlef Seese:
Easy Problems for Tree-Decomposable Graphs.
J. Algorithms 12(2): 308-340 (1991) |
| 1990 |
|---|
| 2 | | Jens Lagergren:
Efficient Parallel Algorithms for Tree-Decomposition and Related Problems
FOCS 1990: 173-182 |
| 1988 |
|---|
| 1 | | Stefan Arnborg,
Jens Lagergren,
Detlef Seese:
Problems Easy for Tree-Decomposable Graphs (Extended Abstract).
ICALP 1988: 38-51 |
