default search action
Jens Lagergren
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j37]Hazal Koptagel
, Seong-Hwan Jun, Joanna Hård, Jens Lagergren
Scuphr: A probabilistic framework for cell lineage tree reconstruction. PLoS Comput. Biol. 20(5): 1012094 (2024) - [c33]Oskar Kviman, Nicola Branchini, Víctor Elvira, Jens Lagergren:
Variational Resampling. AISTATS 2024: 3286-3294 - [c32]Alexandra Maria Hotti, Lennart Alexander Van der Goten, Jens Lagergren:
Benefits of Non-Linear Scale Parameterizations in Black Box Variational Inference through Smoothness Results and Gradient Variance Bounds. AISTATS 2024: 3538-3546 - [c31]Alexandra Hotti, Oskar Kviman, Ricky Molén, Víctor Elvira, Jens Lagergren:
Efficient Mixture Learning in Black-Box Variational Inference. ICML 2024 - [c30]Alfred Nilsson, Klas Wijk, Sai Bharath Chandra Gutha, Erik Englesson, Alexandra Hotti, Carlo Saccardi, Oskar Kviman, Jens Lagergren, Ricardo Vinuesa, Hossein Azizpour:
Indirectly Parameterized Concrete Autoencoders. ICML 2024 - [c29]Harald Melin, Vittorio Zampinetti, Andrew McPherson, Jens Lagergren:
VICTree - A Variational Inference Method for Clonal Tree Reconstruction. RECOMB 2024: 429-433 - [i10]Alfred Nilsson, Klas Wijk, Sai Bharath Chandra Gutha, Erik Englesson, Alexandra Hotti, Carlo Saccardi, Oskar Kviman, Jens Lagergren, Ricardo Vinuesa, Hossein Azizpour:
Indirectly Parameterized Concrete Autoencoders. CoRR abs/2403.00563 (2024) - [i9]Alexandra Hotti, Oskar Kviman, Ricky Molén, Víctor Elvira, Jens Lagergren:
Efficient Mixture Learning in Black-Box Variational Inference. CoRR abs/2406.07083 (2024) - 2023
- [c28]Oskar Kviman, Ricky Molén
Cooperation in the Latent Space: The Benefits of Adding Mixture Components in Variational Autoencoders. ICML 2023: 18008-18022 - [i8]Ludvig Bergenstråhle, Jens Lagergren, Joakim Lundeberg:
Learning Stationary Markov Processes with Contrastive Adjustment. CoRR abs/2303.05497 (2023) - [i7]Oskar Kviman, Ricky Molén, Jens Lagergren:
Improved Variational Bayesian Phylogenetic Inference using Mixtures. CoRR abs/2310.00941 (2023) - 2022
- [j36]José Bonet, Mandi Chen
DeepMP: a deep learning tool to detect DNA base modifications on Nanopore sequencing data. Bioinform. 38(5): 1235-1243 (2022) - [j35]Mohammadreza Mohaghegh Neyshabouri
ToMExO: A probabilistic tree-structured model for cancer progression. PLoS Comput. Biol. 18(12): 1010732 (2022) - [c27]Oskar Kviman, Harald Melin, Hazal Koptagel, Victor Elvira, Jens Lagergren:
Multiple Importance Sampling ELBO and Deep Ensembles of Variational Approximations. AISTATS 2022: 10687-10702 - [c26]Hazal Koptagel, Oskar Kviman, Harald Melin, Negar Safinianaini, Jens Lagergren:
VaiPhy: a Variational Inference Based Algorithm for Phylogeny. NeurIPS 2022 - [i6]Oskar Kviman, Harald Melin, Hazal Koptagel, Víctor Elvira, Jens Lagergren:
Multiple Importance Sampling ELBO and Deep Ensembles of Variational Approximations. CoRR abs/2202.10951 (2022) - [i5]Hazal Koptagel, Oskar Kviman, Harald Melin, Negar Safinianaini, Jens Lagergren:
VaiPhy: a Variational Inference Based Algorithm for Phylogeny. CoRR abs/2203.01121 (2022) - [i4]Oskar Kviman, Ricky Molén, Alexandra Hotti, Semih Kurt, Víctor Elvira, Jens Lagergren:
Learning with MISELBO: The Mixture Cookbook. CoRR abs/2209.15514 (2022) - [i3]Oskar Kviman, Hazal Koptagel, Harald Melin, Jens Lagergren:
Statistical Distance Based Deterministic Offspring Selection in SMC Methods. CoRR abs/2212.12290 (2022) - 2021
- [i2]Alexandra Hotti, Riccardo Sven Risuleo, Stefan Magureanu, Aref Moradi, Jens Lagergren:
The Klarna Product Page Dataset: A Realistic Benchmark for Web Representation Learning. CoRR abs/2111.02168 (2021) - 2020
- [j34]Mohammadreza Mohaghegh Neyshabouri
Inferring tumor progression in large datasets. PLoS Comput. Biol. 16(10) (2020) - [c25]Negar Safinianaini, Camila P. E. de Souza
Orthogonal Mixture of Hidden Markov Models. ECML/PKDD (1) 2020: 509-525
2010 – 2019
- 2017
- [j33]Mattias Frånberg, Rona J. Strawbridge
Fast and general tests of genetic interaction for genome-wide association studies. PLoS Comput. Biol. 13(6) (2017) - 2016
- [j32]Mehmood Alam Khan, Owais Mahmudi, Ikram Ullah, Lars Arvestad
Probabilistic inference of lateral gene transfer events. BMC Bioinform. 17(S-14): 263-270 (2016) - [j31]Niko Beerenwinkel, Chris D. Greenman, Jens Lagergren
Computational Cancer Biology: An Evolutionary Perspective. PLoS Comput. Biol. 12(2) (2016) - [i1]Kerry Zhang, Jussi Karlgren, Cheng Zhang, Jens Lagergren:
Viewpoint and Topic Modeling of Current Events. CoRR abs/1608.04089 (2016) - 2014
- [c24]Pekka Parviainen, Hossein Shahrabi Farahani, Jens Lagergren:
Learning Bounded Tree-width Bayesian Networks using Integer Linear Programming. AISTATS 2014: 751-759 - 2013
- [j30]Joel Sjöstrand
GenPhyloData: realistic simulation of gene family evolution. BMC Bioinform. 14: 209 (2013) - [j29]Mehmood Alam Khan, Isaac Elias, Erik Sjölund, Kristina Nylander, Roman Valls Guimera, Richard Schobesberger, Peter Schmitzberger, Jens Lagergren
fastphylo: Fast tools for phylogenetics. BMC Bioinform. 14: 334 (2013) - [j28]Owais Mahmudi, Joel Sjöstrand
Genome-wide probabilistic reconciliation analysis across vertebrates. BMC Bioinform. 14(S-15): S10 (2013) - 2012
- [j27]Joel Sjöstrand
DLRS: gene tree evolution in light of a species tree. Bioinform. 28(22): 2994-2995 (2012) - 2011
- [j26]Ali Tofigh, Michael T. Hallett
Simultaneous Identification of Duplications and Lateral Gene Transfers. IEEE ACM Trans. Comput. Biol. Bioinform. 8(2): 517-535 (2011) - [c23]Ali Tofigh, Erik Sjölund, Mattias Höglund, Jens Lagergren:
A Global Structural EM Algorithm for a Model of Cancer Progression. NIPS 2011: 163-171 - 2010
- [j25]Mats Ensterö, Örjan Åkerborg
A computational screen for site selective A-to-I editing detects novel sites in neuron specific Hu proteins. BMC Bioinform. 11: 6 (2010)
2000 – 2009
- 2009
- [j24]Lars Arvestad
The gene evolution model and computing its associated probabilities. J. ACM 56(2): 7:1-7:44 (2009) - [j23]Isaac Elias, Jens Lagergren:
Fast neighbor joining. Theor. Comput. Sci. 410(21-23): 1993-2000 (2009) - 2008
- [e2]Keith A. Crandall
Algorithms in Bioinformatics, 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings. Lecture Notes in Computer Science 5251, Springer 2008, ISBN 978-3-540-87360-0 [contents] - 2007
- [j22]Isaac Elias, Jens Lagergren
Fast computation of distance estimators. BMC Bioinform. 8 (2007) - [j21]Bengt Sennblad, Eva Schreil, Ann-Charlotte Berglund Sonnhammer, Jens Lagergren
primetv: a viewer for reconciled trees. BMC Bioinform. 8 (2007) - [j20]Samuel A. Andersson, Jens Lagergren
Motif Yggdrasil: Sampling Sequence Motifs from a Tree Mixture Model. J. Comput. Biol. 14(5): 682-697 (2007) - 2006
- [j19]Marcus Hjelm, Mattias Höglund
New Probabilistic Network Models and Algorithms for Oncogenesis. J. Comput. Biol. 13(4): 853-865 (2006) - [j18]Örjan Svensson, Lars Arvestad
Genome-Wide Survey for Biologically Functional Pseudogenes. PLoS Comput. Biol. 2(5) (2006) - [j17]David Bryant, Jens Lagergren:
Compatibility of unrooted phylogenetic trees is FPT. Theor. Comput. Sci. 351(3): 296-302 (2006) - [c22]Samuel A. Andersson, Jens Lagergren:
Motif Yggdrasil: Sampling from a Tree Mixture Model. RECOMB 2006: 458-472 - 2005
- [c21]Isaac Elias, Jens Lagergren:
Fast Neighbor Joining. ICALP 2005: 1263-1274 - [e1]Jens Lagergren:
Comparative Genomics, RECOMB 2004 International Workshop, RCG 2004, Bertinoro, Italy, October 16-19, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3388, Springer 2005, ISBN 3-540-24455-7 [contents] - 2004
- [j16]Louigi Addario-Berry, Benny Chor, Michael T. Hallett
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. J. Bioinform. Comput. Biol. 2(2): 257-272 (2004) - [j15]Wynand Alkema
MSCAN: identification of functional clusters of transcription factor binding sites. Nucleic Acids Res. 32(Web-Server-Issue): 195-198 (2004) - [j14]Lars Ivansson, Jens Lagergren:
Algorithms for RH Mapping: New Ideas and Improved Analysis. SIAM J. Comput. 34(1): 89-108 (2004) - [c20]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 - [c19]Michael T. Hallett
Simultaneous identification of duplications and lateral transfers. RECOMB 2004: 347-356 - 2003
- [j13]Johan Håstad
Fitting points on the real line and its application to RH mapping. J. Algorithms 49(1): 42-62 (2003) - [j12]David Fernández-Baca, Jens Lagergren:
A Polynomial-Time Algorithm for Near-Perfect Phylogeny. SIAM J. Comput. 32(5): 1115-1127 (2003) - [c18]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 - [c17]Ö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 - [c16]Louigi Addario-Berry, Michael T. Hallett, Jens Lagergren:
Towards Identifying Lateral Gene Transfer Events. Pacific Symposium on Biocomputing 2003: 279-290 - [c15]Louigi Addario-Berry, Benny Chor, Michael T. Hallett
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard. WABI 2003: 202-215 - 2002
- [j11]Jens Lagergren:
Combining polynomial running time and fast convergence for the disk-covering method. J. Comput. Syst. Sci. 65(3): 481-493 (2002) - 2001
- [c14]Michael T. Hallett
Efficient algorithms for lateral gene transfer problems. RECOMB 2001: 149-156 - 2000
- [c13]Michael T. Hallett
Hunting for Functionally Analogous Genes. FSTTCS 2000: 465-476 - [c12]Michael T. Hallett
New algorithms for the duplication-loss model. RECOMB 2000: 138-146
1990 – 1999
- 1999
- [j10]Jens Lagergren, Peter Bro Miltersen:
Guest Editors' Foreword. Nord. J. Comput. 6(2): 135-136 (1999) - 1998
- [j9]David Fernández-Baca, Jens Lagergren:
On the Approximability of the Steiner Tree Problem in Phylogeny. Discret. Appl. Math. 88(1-3): 129-145 (1998) - [j8]Viggo Kann, Jens Lagergren, Alessandro Panconesi:
Approximate Max k-Cut with Subgraph Guarantee. Inf. Process. Lett. 65(3): 145-150 (1998) - [j7]Jens Lagergren:
Upper Bounds on the Size of Obstructions and Intertwines. J. Comb. Theory B 73(1): 7-40 (1998) - [c11]Johan Håstad, Lars Ivansson, Jens Lagergren:
Fitting Points on the Real Line and Its Application to RH Mapping. ESA 1998: 465-476 - 1997
- [j6]Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi:
On the Hardness of Approximating Max k-Cut and its Dual. Chic. J. Theor. Comput. Sci. 1997 (1997) - 1996
- [j5]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) - [j4]Jens Lagergren:
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width. J. Algorithms 20(1): 20-44 (1996) - [j3]Bruno Courcelle, Jens Lagergren:
Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width. Math. Struct. Comput. Sci. 6(2): 141-165 (1996) - [c10]David Fernández-Baca, Jens Lagergren:
A Polynomial-Time Algorithm for Near-Perfect Phylogeny. ICALP 1996: 670-680 - [c9]David Fernández-Baca, Jens Lagergren:
On the Approximability of the Steiner Tree Problem in Phylogeny. ISAAC 1996: 65-74 - [c8]Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi:
On the Hardness of Approximating Max k-Cut and Its Dual. ISTCS 1996: 61-67 - [c7]Jens Lagergren:
Hypothesis Testing in Perfect Phylogeny for a Bounded Number of Characters. STACS 1996: 605-616 - 1994
- [j2]Jens Lagergren:
The Nonexistence of Reduction Rules Giving an Embedding into a K-tree. Discret. Appl. Math. 54(2-3): 219-223 (1994) - [c6]Jens Lagergren:
The Size of an Interwine. ICALP 1994: 520-531 - 1993
- [c5]Bruno Courcelle, Jens Lagergren:
Recognizable Sets of Graphs of Bounded Tree-Width. Dagstuhl Seminar on Graph Transformations in Computer Science 1993: 138-152 - 1991
- [j1]Stefan Arnborg, Jens Lagergren, Detlef Seese:
Easy Problems for Tree-Decomposable Graphs. J. Algorithms 12(2): 308-340 (1991) - [c4]Jens Lagergren:
An upper bound on the size of an obstruction. Graph Structure Theory 1991: 601-621 - [c3]Jens Lagergren, Stefan Arnborg:
Finding Minimal Forbidden Minors Using a Finite Congruence. ICALP 1991: 532-543 - 1990
- [c2]Jens Lagergren:
Efficient Parallel Algorithms for Tree-Decomposition and Related Problems. FOCS 1990: 173-182
1980 – 1989
- 1988
- [c1]Stefan Arnborg, Jens Lagergren, Detlef Seese:
Problems Easy for Tree-Decomposable Graphs (Extended Abstract). ICALP 1988: 38-51
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-12-02 21:28 CET 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: