Jesper Jansson

According to our database1, Jesper Jansson authored at least 85 papers between 1997 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
An Efficient Algorithm for the Rooted Triplet Distance Between Galled Trees.
Journal of Computational Biology, 2019

The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets.
Discret. Appl. Math., 2019

Editorial: Special Issue on Efficient Data Structures.
Algorithms, 2019

Building a Small and Informative Phylogenetic Supertree.
Proceedings of the 19th International Workshop on Algorithms in Bioinformatics, 2019

Computing the Rooted Triplet Distance Between Phylogenetic Networks.
Proceedings of the Combinatorial Algorithms - 30th International Workshop, 2019

Pushing the Online Matrix-Vector Conjecture Off-Line and Identifying Its Easy Cases.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

Graph Orientation with Edge Modifications.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

Exact Algorithms for the Bounded Repetition Longest Common Subsequence Problem.
Proceedings of the Combinatorial Optimization and Applications, 2019

2018
Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree.
IEEE/ACM Trans. Comput. Biology Bioinform., 2018

Determining the Consistency of Resolved Triplets and Fan Triplets.
Journal of Computational Biology, 2018

3D Rectangulations and Geometric Matrix Multiplication.
Algorithmica, 2018

Graph Orientation with Splits.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

New and Improved Algorithms for Unordered Tree Inclusion.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
On the parameterized complexity of associative and commutative unification.
Theor. Comput. Sci., 2017

A More Practical Algorithm for the Rooted Triplet Distance.
Journal of Computational Biology, 2017

On finding the Adams consensus tree.
Inf. Comput., 2017

New Algorithms for Unordered Tree Inclusion.
CoRR, 2017

2016
Maximum Agreement Supertree.
Encyclopedia of Algorithms, 2016

Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network.
Encyclopedia of Algorithms, 2016

Phylogenetic Tree Construction from a Distance Matrix.
Encyclopedia of Algorithms, 2016

Perfect Phylogeny (Bounded Number of States).
Encyclopedia of Algorithms, 2016

Directed Perfect Phylogeny (Binary Characters).
Encyclopedia of Algorithms, 2016

Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation.
Theory Comput. Syst., 2016

Improved Algorithms for Constructing Consensus Trees.
J. ACM, 2016

Faster Algorithms for Computing the R* Consensus Tree.
Algorithmica, 2016

Minimal Phylogenetic Supertrees and Local Consensus Trees.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
Similar Subtree Search Using Extended Tree Inclusion.
IEEE Trans. Knowl. Data Eng., 2015

Graph Orientations Optimizing the Number of Light or Heavy Vertices.
J. Graph Algorithms Appl., 2015

Linked Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space.
Algorithmica, 2015

The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014
Fast relative Lempel-Ziv self-index for similar sequences.
Theor. Comput. Sci., 2014

Computing the rooted triplet distance between galled trees by counting triangles.
J. Discrete Algorithms, 2014

2013
Editorial: Special Issue on Graph Algorithms.
Algorithms, 2013

Constructing the R* Consensus Tree of Two Trees in Subcubic Time.
Algorithmica, 2013

Algorithms for the Majority Rule (+) Consensus Tree and the Frequency Difference Consensus Tree.
Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

An Optimal Algorithm for Building the Majority Rule Consensus Tree.
Proceedings of the Research in Computational Molecular Biology, 2013

2012
More efficient periodic traversal in anonymous undirected graphs.
Theor. Comput. Sci., 2012

The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree.
SIAM J. Comput., 2012

Ultra-succinct representation of ordered trees with applications.
J. Comput. Syst. Sci., 2012

Polynomial-Time Algorithms for Building a Consensus MUL-Tree.
Journal of Computational Biology, 2012

Faster computation of the Robinson-Foulds distance between phylogenetic networks.
Inf. Sci., 2012

Inferring a graph from path frequency.
Discret. Appl. Math., 2012

Asymptotic Limits of a New Type of Maximization Recurrence with an Application to Bioinformatics.
Proceedings of the Theory and Applications of Models of Computation, 2012

CRAM: Compressed Random Access Memory.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Upper and Lower Degree Bounded Graph Orientation with Minimum Penalty.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011
Computing a Smallest Multilabeled Phylogenetic Tree from Rooted Triplets.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

Algorithms for Finding a Most Similar Subforest.
Theory Comput. Syst., 2011

Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree.
J. Comb. Optim., 2011

Approximation Algorithms for Buy-at-Bulk Geometric Network Design.
Int. J. Found. Comput. Sci., 2011

Graph Orientation to Maximize the Minimum Weighted Outdegree.
Int. J. Found. Comput. Sci., 2011

Flexible taxonomic assignment of ambiguous sequencing reads.
BMC Bioinformatics, 2011

Algorithms for Building Consensus MUL-trees.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
New results on optimizing rooted triplets consistency.
Discret. Appl. Math., 2010

Compressed random access memory
CoRR, 2010

Linear-time protein 3-D structure searching with insertions and deletions.
Algorithms for Molecular Biology, 2010

Accurate Taxonomic Assignment of Short Pyrosequencing Reads.
Proceedings of the Biocomputing 2010: Proceedings of the Pacific Symposium, 2010

2009
Computing a Smallest Multi-labeled Phylogenetic Tree from Rooted Triplets.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Phylogenetic Tree Construction from a Distance Matrix.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Perfect Phylogeny (Bounded Number of States).
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Directed Perfect Phylogeny (Binary Characters).
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

2007
Online and Dynamic Recognition of Squarefree Strings.
Int. J. Found. Comput. Sci., 2007

On the Approximability of Maximum and Minimum Edge Clique Partition Problems.
Int. J. Found. Comput. Sci., 2007

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.
Algorithmica, 2007

Ultra-succinct representation of ordered trees.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006
Inferring a level-1 phylogenetic network from a dense set of rooted triplets.
Theor. Comput. Sci., 2006

Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network.
SIAM J. Comput., 2006

Local Gapped Subforest Alignment and Its Application in Finding RNA Structural Motifs.
Journal of Computational Biology, 2006

Inferring Phylogenetic Relationships Avoiding Forbidden Rooted Triplets.
J. Bioinformatics and Computational Biology, 2006

Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix.
J. Bioinformatics and Computational Biology, 2006

A Faster and More Space-Efficient Algorithm for Inferring Arc-Annotations of RNA Sequences through Alignment.
Algorithmica, 2006

2005
Rooted Maximum Agreement Supertrees.
Algorithmica, 2005

Finding Short Right-Hand-on-the-Wall Walks in Graphs.
Proceedings of the Structural Information and Communication Complexity, 2005

Constructing a Smallest Refining Galled Phylogenetic Network.
Proceedings of the Research in Computational Molecular Biology, 2005

2004
Approximation algorithms for Hamming clustering problems.
J. Discrete Algorithms, 2004

Semi-Balanced Colorings of Graphs: Generalized 2-Colorings Based on a Relaxed Discrepancy Condition.
Graphs and Combinatorics, 2004

Computing the Maximum Agreement of Phylogenetic Networks.
Electron. Notes Theor. Comput. Sci., 2004

The Maximum Agreement of Two Nested Phylogenetic Networks.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

2003
Consensus Algorithms for Trees and Strings.
PhD thesis, 2003

A Fast Algorithm for Optimal Alignment between Similar Ordered Trees.
Fundam. Inform., 2003

2001
On the Complexity of Inferring Rooted Evolutionary Trees.
Electron. Notes Discret. Math., 2001

1999
On the Complexity of Constructing Evolutionary Trees.
J. Comb. Optim., 1999

Efficient Approximation Algorithms for the Hamming Center Problem.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998
Inferring Ordered Trees from Local Constraints.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1997
On the Complexity of Computing Evolutionary Trees.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997


  Loading...