Paul E. Kearney

According to our database1, Paul E. Kearney authored at least 26 papers between 1994 and 2005.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2005
A Collapsing Method for the Efficient Recovery of Optimal Edges in Phylogenetic Trees.
Int. J. Artif. Intell. Tools, 2005

2004
Selecting the branches for an evolutionary tree.: A polynomial time approximation scheme.
J. Algorithms, 2004

2003
Efficient Generation of Uniform Samples from Phylogenetic Trees.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

2002
Methods for reconstructing the history of tandem repeats and their application to the human genome.
J. Comput. Syst. Sci., 2002

NeST graphs.
Discret. Appl. Math., 2002

2001
An information-based sequence distance and its application to whole mitochondrial genome phylogeny.
Bioinform., 2001

Picking fruit from the tree of life: comments on taxonomic sampling and quartet methods.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001

Phylogenetics in the Post-Genomic Era - Session Introduction.
Proceedings of the 6th Pacific Symposium on Biocomputing, 2001

Agent Oriented Analysis Using Message/UML.
Proceedings of the Agent-Oriented Software Engineering II, Second International Workshop, 2001

2000
A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application.
SIAM J. Comput., 2000

Embodiment of Evolutionary Computation in General Agents.
Evol. Comput., 2000

Computing the quartet distance between evolutionary trees.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract).
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Phylogenetic <i>k</i>-Root and Steiner <i>k</i>-Root.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999
Some open problems in computational molecular biology.
SIGACT News, 1999

Evolutionary Trees and Ordinal Assertions.
Algorithmica, 1999

Recovering Branches on the Tree of Life: An Approximation Algorithm.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Quartet Cleaning: Improved Algorithms and Simulations.
Proceedings of the Algorithms, 1999

1998
Tree Powers.
J. Algorithms, 1998

The ordinal quartet method.
Proceedings of the Second Annual International Conference on Research in Computational Molecular Biology, 1998

Orchestrating Quartets: Approximation and Data Correction.
Proceedings of the 39th Annual Symposium on Foundations of Computer Science, 1998

1997
The relationship between a phylogeny and its ordinal assertions.
PhD thesis, 1997

A Six-Point Condition for Ordinal Matrices.
J. Comput. Biol., 1997

Inferring Evolutionary Trees from Ordinal Data.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1994
Emergent Behaviour in a Multi-Agent Economic Situation.
Proceedings of the Eleventh European Conference on Artificial Intelligence, 1994

Tolerance-Free NeST Representations.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994


  Loading...