| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ali Tofigh, Michael T. Hallett, Jens Lagergren |
Simultaneous Identification of Duplications and Lateral Gene Transfers.  |
IEEE/ACM Trans. Comput. Biology Bioinform.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ali Tofigh, Erik Sjlund, Mattias Höglund, Jens Lagergren |
A Global Structural EM Algorithm for a Model of Cancer Progression. |
NIPS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Mats Ensterö, Örjan Åkerborg, Daniel Lundin, Bei Wang, Terrence S. Furey, Marie Öhman, Jens Lagergren |
A computational screen for site selective A-to-I editing detects novel sites in neuron specific Hu proteins. |
BMC Bioinformatics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Isaac Elias, Jens Lagergren |
Fast neighbor joining. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Arvestad, Jens Lagergren, Bengt Sennblad |
The gene evolution model and computing its associated probabilities. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
probability, evolution, Phylogeny, duplication, reconciliation, loss, gene |
| 1 | Keith A. Crandall, Jens Lagergren (eds.) |
Algorithms in Bioinformatics, 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings |
WABI |
2008 |
DBLP BibTeX RDF |
|
| 1 | Isaac Elias, Jens Lagergren |
Fast computation of distance estimators. |
BMC Bioinformatics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Bengt Sennblad, Eva Schreil, Ann-Charlotte Berglund Sonnhammer, Jens Lagergren, Lars Arvestad |
primetv: a viewer for reconciled trees. |
BMC Bioinformatics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel A. Andersson, Jens Lagergren |
Motif Yggdrasil: Sampling Sequence Motifs from a Tree Mixture Model. |
Journal of Computational Biology |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | David Bryant, Jens Lagergren |
Compatibility of unrooted phylogenetic trees is FPT. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcus Hjelm, Mattias Höglund, Jens Lagergren |
New Probabilistic Network Models and Algorithms for Oncogenesis. |
Journal of Computational Biology |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Örjan Svensson, Lars Arvestad, Jens Lagergren |
Genome-Wide Survey for Biologically Functional Pseudogenes. |
PLoS Computational Biology |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel A. Andersson, Jens Lagergren |
Motif Yggdrasil: Sampling from a Tree Mixture Model. |
RECOMB |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Isaac Elias, Jens Lagergren |
Fast Neighbor Joining. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Lagergren (eds.) |
Comparative Genomics, RECOMB 2004 International Workshop, RCG 2004, Bertinoro, Italy, October 16-19, 2004, Revised Selected Papers |
Comparative Genomics |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Wynand Alkema, Öjvind Johansson, Jens Lagergren, Wyeth W. Wasserman |
MSCAN: identification of functional clusters of transcription factor binding sites. |
Nucleic Acids Research |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Lars Ivansson, Jens Lagergren |
Algorithms for RH Mapping: New Ideas and Improved Analysis. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
gene tree, orthology, algorithms, bayesian analysis, reconciliation |
| 1 | Michael T. Hallett, Jens Lagergren, Ali Tofigh |
Simultaneous identification of duplications and lateral transfers. |
RECOMB |
2004 |
DBLP DOI BibTeX RDF |
gene loss, lateral gene transfer, gene duplication |
| 1 | Johan Håstad, Lars Ivansson, Jens Lagergren |
Fitting points on the real line and its application to RH mapping. |
J. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | David Fernández-Baca, Jens Lagergren |
A Polynomial-Time Algorithm for Near-Perfect Phylogeny. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Louigi Addario-Berry, Michael T. Hallett, Jens Lagergren |
Towards Identifying Lateral Gene Transfer Events. |
Pacific Symposium on Biocomputing |
2003 |
DBLP BibTeX RDF |
|
| 1 | Louigi Addario-Berry, Benny Chor, Michael T. Hallett, Jens Lagergren, Alessandro Panconesi, Todd Wareham |
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. |
WABI |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ö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 |
DBLP BibTeX RDF |
|
| 1 | Lars Arvestad, Ann-Charlotte Berglund, Jens Lagergren, Bengt Sennblad |
Bayesian gene/species tree reconciliation and orthology analysis using MCMC. |
ISMB (Supplement of Bioinformatics) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Jens Lagergren |
Combining polynomial running time and fast convergence for the disk-covering method. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael T. Hallett, Jens Lagergren |
Efficient algorithms for lateral gene transfer problems. |
RECOMB |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael T. Hallett, Jens Lagergren |
New algorithms for the duplication-loss model. |
RECOMB |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael T. Hallett, Jens Lagergren |
Hunting for Functionally Analogous Genes. |
FSTTCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Lagergren, Peter Bro Miltersen |
Guest Editors' Foreword. |
Nord. J. Comput. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Jens Lagergren |
Upper Bounds on the Size of Obstructions and Intertwines. |
J. Comb. Theory, Ser. B |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Viggo Kann, Jens Lagergren, Alessandro Panconesi |
Approximate Max k-Cut with Subgraph Guarantee. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | David Fernández-Baca, Jens Lagergren |
On the Approximability of the Steiner Tree Problem in Phylogeny. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan Håstad, Lars Ivansson, Jens Lagergren |
Fitting Points on the Real Line and Its Application to RH Mapping. |
ESA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Viggo Kann, Jens Lagergren, Alessandro Panconesi |
Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems. |
Inf. Process. Lett. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Jens Lagergren |
Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width. |
Mathematical Structures in Computer Science |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Lagergren |
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width. |
J. Algorithms |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | David Fernández-Baca, Jens Lagergren |
A Polynomial-Time Algorithm for Near-Perfect Phylogeny. |
ICALP |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Lagergren |
Hypothesis Testing in Perfect Phylogeny for a Bounded Number of Characters. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi |
On the Hardness of Approximating Max k-Cut and Its Dual. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | David Fernández-Baca, Jens Lagergren |
On the Approximability of the Steiner Tree Problem in Phylogeny. |
ISAAC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Lagergren |
The Nonexistence of Reduction Rules Giving an Embedding into a K-tree. |
Discrete Applied Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Lagergren |
The Size of an Interwine. |
ICALP |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruno Courcelle, Jens Lagergren |
Recognizable Sets of Graphs of Bounded Tree-Width. |
Dagstuhl Seminar on Graph Transformations in Computer Science |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Arnborg, Jens Lagergren, Detlef Seese |
Easy Problems for Tree-Decomposable Graphs. |
J. Algorithms |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Lagergren, Stefan Arnborg |
Finding Minimal Forbidden Minors Using a Finite Congruence. |
ICALP |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Jens Lagergren |
An upper bound on the size of an obstruction. |
Graph Structure Theory |
1991 |
DBLP BibTeX RDF |
|
| 1 | Jens Lagergren |
Efficient Parallel Algorithms for Tree-Decomposition and Related Problems |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
sequential time complexity, monadic second order properties, linear extended monadic second order extremum problems, concurrent-read, concurrent-write parallel random access machine, enumeration problems, parallel algorithms, graphs, tree-decomposition, tree width, CRCW PRAM |
| 1 | Stefan Arnborg, Jens Lagergren, Detlef Seese |
Problems Easy for Tree-Decomposable Graphs (Extended Abstract). |
ICALP |
1988 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")