The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Vincent Moulton: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Barbara Holland, Glenn Conner, Katharina T. Huber, Vincent Moulton
    Imputing Supertrees and Supernetworks from Quartets. [Citation Graph (0, 0)][DBLP]
    WABI, 2006, pp:162- [Conf]
  2. Barbara Holland, Vincent Moulton
    Consensus Networks: A Method for Visualising Incompatibilities in Collections of Trees. [Citation Graph (0, 0)][DBLP]
    WABI, 2003, pp:165-176 [Conf]
  3. David Bryant, Vincent Moulton
    NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:375-391 [Conf]
  4. Warwick Tucker, Vincent Moulton
    Reconstructing Metabolic Networks Using Interval Analysis. [Citation Graph (0, 0)][DBLP]
    WABI, 2005, pp:192-203 [Conf]
  5. Dietmar Cieslik, Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton
    Connectivity calculus. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2003, v:16, n:3, pp:395-399 [Journal]
  6. 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]
  7. Sverker Edvardsson, Paul P. Gardner, Anthony M. Poole, Michael D. Hendy, David Penny, Vincent Moulton
    A Search for H/ACA SnoRNAs in Yeast Using MFE Secondary Structure Prediction. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2003, v:19, n:7, pp:865-873 [Journal]
  8. Kristoffer Forslund, Daniel H. Huson, Vincent Moulton
    VisRD--visual recombination detection. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2004, v:20, n:18, pp:3654-3655 [Journal]
  9. Jens Stoye, Vincent Moulton, Andreas W. M. Dress
    DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment. [Citation Graph (0, 0)][DBLP]
    Computer Applications in the Biosciences, 1997, v:13, n:6, pp:625-626 [Journal]
  10. Eva Freyhult, Paul P. Gardner, Vincent Moulton
    A comparison of RNA folding measures. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2005, v:6, n:, pp:241- [Journal]
  11. Eva Freyhult, Peteris Prusis, Maris Lapinsh, Jarl E. S. Wikberg, Vincent Moulton, Mats G. Gustafsson
    Unbiased descriptor and parameter selection confirms the potential of proteochemometric modelling. [Citation Graph (0, 0)][DBLP]
    BMC Bioinformatics, 2005, v:6, n:, pp:50- [Journal]
  12. Hans-Jürgen Bandelt, Katharina T. Huber, Vincent Moulton
    Quasi-median graphs from sets of partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:122, n:1-3, pp:23-35 [Journal]
  13. Andreas W. M. Dress, Barbara Holland, Katharina T. Huber, Jack H. Koolen, Vincent Moulton, Jan Weyer-Menkhoff
    Delta additive and Delta ultra-additive maps, Gromov's trees, and the Farris transform. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:146, n:1, pp:51-73 [Journal]
  14. Andreas W. M. Dress, Daniel H. Huson, Vincent Moulton
    Analyzing and Visualizing Sequence and Distance Data Using SplitsTree. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:71, n:1-3, pp:95-109 [Journal]
  15. 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]
  16. Vincent Moulton, Mike A. Steel
    Retractions of Finite Distance Functions Onto Tree Metrics. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:215-233 [Journal]
  17. Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton
    Affine Maps That Induce Polyhedral Complex Isomorphisms. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:24, n:1, pp:49-60 [Journal]
  18. Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton
    The Tight Span of an Antipodal Metric Space: Part II--Geometrical Properties. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:4, pp:567-586 [Journal]
  19. Oliver Goodman, Vincent Moulton
    On the tight span of an antipodal graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:73-96 [Journal]
  20. Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton
    The tight span of an antipodal metric space - Part I: : Combinatorial properties. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:303, n:1-3, pp:65-79 [Journal]
  21. Katharina T. Huber, Vincent Moulton
    The relation graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:244, n:1-3, pp:153-166 [Journal]
  22. S. Bang, Jack H. Koolen, Vincent Moulton
    A bound for the number of columns l(c, a, b) in the intersection array of a distance-regular graph. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:7, pp:785-795 [Journal]
  23. Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton
    Six Points Suffice: How to Check for Metric Consistency. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:4, pp:465-474 [Journal]
  24. Andreas W. M. Dress, Katharina T. Huber, Vincent Moulton
    Antipodal Metrics and Split Systems. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:2, pp:187-200 [Journal]
  25. Andreas W. M. Dress, Jack H. Koolen, Vincent Moulton
    On Line Arrangements in the Hyperbolic Plane. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:5, pp:549-557 [Journal]
  26. Andreas W. M. Dress, Jack H. Koolen, Vincent Moulton
    Addendum to "on line arrangements in the hyperbolic plane" [European J. Combin.23 (2002) 549-557]. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:3, pp:347- [Journal]
  27. Andreas W. M. Dress, Vincent Moulton, Werner F. Terhalle
    T-theory: An Overview. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:161-175 [Journal]
  28. Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton
    On the structure of the tight-span of a totally split-decomposable metric. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2006, v:27, n:3, pp:461-479 [Journal]
  29. Jack H. Koolen, Vincent Moulton
    Hyperbolic Bridged Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:6, pp:683-699 [Journal]
  30. Jack H. Koolen, Vincent Moulton
    On a Conjecture of Bannai and Ito: There are Finitely Many Distance-regular Graphs with Degree 5, 6 or 7. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:8, pp:987-1006 [Journal]
  31. Jack H. Koolen, Vincent Moulton, Dragan Stevanovic
    The structure of spherical graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:2, pp:299-310 [Journal]
  32. Jack H. Koolen, Vincent Moulton, Udo Tönges
    A Classification of the Six-point Prime Metrics. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:6, pp:815-829 [Journal]
  33. Jack H. Koolen, Vincent Moulton
    Maximal Energy Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:1, pp:131-135 [Journal]
  34. Vincent Moulton, Michael Zuker, Mike A. Steel, Robin Pointon, David Penny
    Metrics on RNA Secondary Structures. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2000, v:7, n:1-2, pp:277-292 [Journal]
  35. Warwick Tucker, Vincent Moulton
    Parameter Reconstruction for Biochemical Networks Using Interval Analysis. [Citation Graph (0, 0)][DBLP]
    Reliable Computing, 2006, v:12, n:5, pp:389-402 [Journal]
  36. Katharina T. Huber, Vincent Moulton, Michael Anthony Steel
    Four Characters Suffice to Convexly Define a Phylogenetic Tree. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:18, n:4, pp:835-843 [Journal]
  37. Andreas W. M. Dress, Katharina T. Huber, Jacobus H. Koolen, Vincent Moulton
    An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces. [Citation Graph (0, 0)][DBLP]
    COCOA, 2007, pp:4-10 [Conf]
  38. Jack H. Koolen, Vincent Moulton, Udo Tönges
    The coherency index. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:192, n:1-3, pp:205-222 [Journal]

  39. Time Series Data Mining Algorithms for Identifying Short RNA in Arabidopsis thaliana. [Citation Graph (, )][DBLP]


  40. Constructing Phylogenetic Supernetworks from Quartets. [Citation Graph (, )][DBLP]


  41. Cut points in metric spaces. [Citation Graph (, )][DBLP]


  42. Block realizations of finite metrics and the tight-span construction I: The embedding theorem. [Citation Graph (, )][DBLP]


  43. A graph-theoretical invariant of topological spaces. [Citation Graph (, )][DBLP]


  44. Barriers in metric spaces. [Citation Graph (, )][DBLP]


  45. Phylogenetic diversity and the maximum coverage problem. [Citation Graph (, )][DBLP]


  46. Boltzmann probability of RNA structural neighbors and riboswitch detection. [Citation Graph (, )][DBLP]


  47. A toolkit for analysing large-scale plant small RNA datasets. [Citation Graph (, )][DBLP]


  48. PADRE: a package for analyzing and displaying reticulate evolution. [Citation Graph (, )][DBLP]


  49. Identifying recombinants in human and primate immunodeficiency virus sequence alignments using quartet scanning. [Citation Graph (, )][DBLP]


  50. Finding sRNA generative locales from high-throughput sequencing data with NiBLS. [Citation Graph (, )][DBLP]


  51. An algorithm for computing cutpoints in finite metric spaces [Citation Graph (, )][DBLP]


  52. Consistency of the QNet algorithm for generating planar split networks from weighted quartets. [Citation Graph (, )][DBLP]


  53. Concerning the Relationship between Realizations and Tight Spans of Finite Metrics. [Citation Graph (, )][DBLP]


  54. Two theorems concerning the Bannai-Ito conjecture. [Citation Graph (, )][DBLP]


  55. Counting vertices and cubes in median graphs of circular split systems. [Citation Graph (, )][DBLP]


  56. Compatible decompositions and block realizations of finite metrics. [Citation Graph (, )][DBLP]


  57. Optimal realizations of generic five-point metrics. [Citation Graph (, )][DBLP]


Search in 0.036secs, Finished in 0.040secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002