The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Charles Semple: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Charles Semple, Mike A. Steel
    Tree Reconstruction via a Closure Operation on Partial Splits. [Citation Graph (0, 0)][DBLP]
    JOBIM, 2000, pp:126-134 [Conf]
  2. Katharina T. Huber, Vincent Moulton, Charles Semple, Mike A. Steel
    Recovering a phylogenetic tree using pairwise closure operations. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2005, v:18, n:3, pp:361-366 [Journal]
  3. Charles Semple, Philip Daniel, Wim Hordijk, Roderic D. M. Page, Mike A. Steel
    Supertree algorithms for ancestral divergence dates and nested taxa. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2004, v:20, n:15, pp:2355-2360 [Journal]
  4. Katharina T. Huber, Vincent Moulton, Charles Semple
    Replacing cliques by stars in quasi-median graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:194-203 [Journal]
  5. Charles Semple
    Reconstructing Minimal Rooted Trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:127, n:3, pp:489-503 [Journal]
  6. Charles Semple, Mike A. Steel
    A supertree method for rooted trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:105, n:1-3, pp:147-158 [Journal]
  7. Magnus Bordewich, Charles Semple
    Computing the minimum number of hybridization events for a consistent evolutionary history. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:8, pp:914-928 [Journal]
  8. Magnus Bordewich, Katharina T. Huber, Charles Semple
    Identifying phylogenetic trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:300, n:1-3, pp:30-43 [Journal]
  9. James G. Oxley, Charles Semple, Dirk L. Vertigan, Geoffrey P. Whittle
    Infinite antichains of matroids with characteristic set {p}. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:242, n:1-3, pp:175-185 [Journal]
  10. Charles Semple, Mike A. Steel
    A characterization for a set of partial partitions to define an X-tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:247, n:1-3, pp:169-186 [Journal]
  11. Rhiannon Hall, James G. Oxley, Charles Semple
    The structure of 3-connected matroids of path width three. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:3, pp:964-989 [Journal]
  12. James G. Oxley, Charles Semple, Geoff Whittle
    The structure of the 3-separations of 3-connected matroids II. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:4, pp:1239-1261 [Journal]
  13. Rhiannon Hall, James G. Oxley, Charles Semple, Geoffrey P. Whittle
    On Matroids of Branch-Width Three. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:1, pp:148-171 [Journal]
  14. James G. Oxley, Charles Semple, Dirk L. Vertigan
    Generalized Delta?-Y Exchange and k-Regular Matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:79, n:1, pp:1-65 [Journal]
  15. James G. Oxley, Charles Semple, Geoff Whittle
    The structure of the 3-separations of 3-connected matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:92, n:2, pp:257-293 [Journal]
  16. Philip Daniel, Charles Semple
    A Class of General Supertree Methods for Nested Taxa. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:2, pp:463-480 [Journal]
  17. Charles Semple, Mike A. Steel
    Unicyclic Networks: Compatibility and Enumeration. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2006, v:3, n:1, pp:84-91 [Journal]
  18. Magnus Bordewich, Charles Semple
    Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2007, v:4, n:3, pp:458-466 [Journal]

  19. Optimizing phylogenetic diversity across two trees. [Citation Graph (, )][DBLP]


  20. Note on the hybridization number and subtree distance in phylogenetics. [Citation Graph (, )][DBLP]


  21. Identifying X-Trees with Few Characters. [Citation Graph (, )][DBLP]


  22. Locating a tree in a phylogenetic network [Citation Graph (, )][DBLP]


  23. Negative Correlation in Graphs and Matroids. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002