default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul E. Kearney
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[j12]Michael Hu
, Paul E. Kearney, Jonathan H. Badger:
A Collapsing Method for the Efficient Recovery of Optimal Edges in Phylogenetic Trees. Int. J. Artif. Intell. Tools 14(5): 717-732 (2005)- 2004
- [j11]Jonathan H. Badger, Paul E. Kearney, Ming Li, John Tsang, Tao Jiang:
Selecting the branches for an evolutionary tree.: A polynomial time approximation scheme. J. Algorithms 51(1): 1-14 (2004) - 2003
- [c15]Michael Hu, Paul E. Kearney, Jonathan H. Badger:
A Collapsing Method for the Efficient Recovery of Optimal Edges in Phylogenetic Trees. BIBE 2003: 95- - [c14]Paul E. Kearney, J. Ian Munro, Derek Phillips:
Efficient Generation of Uniform Samples from Phylogenetic Trees. WABI 2003: 177-189 - 2002
- [j10]Ryan B. Hayward, Paul E. Kearney, Andrew J. Malton:
NeST graphs. Discret. Appl. Math. 121(1-3): 139-153 (2002) - [j9]Deep Jaitly, Paul E. Kearney, Guo-Hui Lin, Bin Ma:
Methods for reconstructing the history of tandem repeats and their application to the human genome. J. Comput. Syst. Sci. 65(3): 494-507 (2002) - 2001
- [j8]Ming Li, Jonathan H. Badger, Xin Chen, Sam Kwong, Paul E. Kearney, Haoyong Zhang:
An information-based sequence distance and its application to whole mitochondrial genome phylogeny. Bioinform. 17(1): 149-154 (2001) - [c13]Giovanni Caire, Wim Coulier, Francisco J. Garijo, Jorge J. Gómez-Sanz, Juan Pavón, Francisco Leal, Paulo Chainho, Paul E. Kearney, Jamie Stark, Richard Evans, Philippe Massonet:
Agent Oriented Analysis Using Message/UML. AOSE 2001: 119-135 - [c12]Jennifer E. Steinbachs, Paul E. Kearney:
Phylogenetics in the Post-Genomic Era - Session Introduction. Pacific Symposium on Biocomputing 2001: 544-546 - [c11]Jonathan H. Badger, Paul E. Kearney:
Picking fruit from the tree of life: comments on taxonomic sampling and quartet methods. SAC 2001: 61-67 - 2000
- [j7]Robert E. Smith, Claudio Bonacina, Paul E. Kearney, Walter Merlat:
Embodiment of Evolutionary Computation in General Agents. Evol. Comput. 8(4): 475-493 (2000) - [j6]Tao Jiang, Paul E. Kearney, Ming Li:
Some Open Problems in Computational Molecular Biology. J. Algorithms 34(1): 194-201 (2000) - [j5]Tao Jiang, Paul E. Kearney, Ming Li:
A Polynomial Time Approximation Scheme for Inferring Evolutionary Trees from Quartet Topologies and Its Application. SIAM J. Comput. 30(6): 1942-1961 (2000) - [c10]Guo-Hui Lin, Tao Jiang, Paul E. Kearney:
Phylogenetic k-Root and Steiner k-Root. ISAAC 2000: 539-551 - [c9]David Bryant, John Tsang, Paul E. Kearney, Ming Li:
Computing the quartet distance between evolutionary trees. SODA 2000: 285-286 - [c8]Vincent Berry, David Bryant, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham, Haoyong Zhang:
A practical algorithm for recovering the best supported edges of an evolutionary tree (extended abstract). SODA 2000: 287-296
1990 – 1999
- 1999
- [j4]Paul E. Kearney, Ryan Hayward, Henk Meijer:
Evolutionary Trees and Ordinal Assertions. Algorithmica 25(2-3): 196-221 (1999) - [j3]Tao Jiang, Paul E. Kearney, Ming Li:
Some open problems in computational molecular biology. SIGACT News 30(3): 43-49 (1999) - [c7]Vincent Berry, Tao Jiang, Paul E. Kearney, Ming Li, Todd Wareham:
Quartet Cleaning: Improved Algorithms and Simulations. ESA 1999: 313-324 - [c6]Paul E. Kearney, Ming Li, John Tsang, Tao Jiang:
Recovering Branches on the Tree of Life: An Approximation Algorithm. SODA 1999: 537-546 - 1998
- [j2]Paul E. Kearney, Derek G. Corneil:
Tree Powers. J. Algorithms 29(1): 111-131 (1998) - [c5]Tao Jiang, Paul E. Kearney, Ming Li:
Orchestrating Quartets: Approximation and Data Correction. FOCS 1998: 416-425 - [c4]Paul E. Kearney:
The ordinal quartet method. RECOMB 1998: 125-134 - 1997
- [b1]Paul E. Kearney:
The relationship between a phylogeny and its ordinal assertions. University of Toronto, Canada, 1997 - [j1]Paul E. Kearney:
A Six-Point Condition for Ordinal Matrices. J. Comput. Biol. 4(2): 143-156 (1997) - [c3]Paul E. Kearney, Ryan Hayward, Henk Meijer:
Inferring Evolutionary Trees from Ordinal Data. SODA 1997: 418-426 - 1994
- [c2]Ryan Hayward, Paul E. Kearney:
Tolerance-Free NeST Representations. CCCG 1994: 275-280 - [c1]Paul E. Kearney, Arvindra Sehmi, Robert M. Smith:
Emergent Behaviour in a Multi-Agent Economic Situation. ECAI 1994: 284-288
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-04-24 22:52 CEST 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:
