SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Moulton T) srt2:(2000-2004)"

Search: WFRF:(Moulton T) > (2000-2004)

  • Result 11-15 of 15
Sort/group result
   
EnumerationReferenceCoverFind
11.
  • Huber, Katharina T, et al. (author)
  • Pruned median networks : A technique for reducing the complexity of median networks
  • 2001
  • In: Molecular Phylogenetics and Evolution. - : Elsevier BV. - 1055-7903 .- 1095-9513. ; 19:2, s. 302-310
  • Journal article (peer-reviewed)abstract
    • Observations from molecular marker studies on recently diverged species indicate that substitution patterns in DNA sequences can often be complex and poorly described by tree-like bifurcating evolutionary models. These observations might result from processes of-species diversification and/or processes of sequence evolution that are not tree-like. In these Cases, bifurcating tree representations provide poor visualization of phylogenetic signals in sequence data. In this paper, we use median networks to study DNA sequence substitution patterns in plant nuclear and chloroplast markers. We describe how to prune median networks to obtain so called pruned median networks. These simpler networks may help to provide a useful framework for investigating the phylogenetic complexity of recently diverged taxa with hybrid origins.
  •  
12.
  •  
13.
  • Huber, K. T., et al. (author)
  • The relation graph
  • 2002
  • In: Discrete Mathematics. - 0012-365X .- 1872-681X. ; 244:1-3, s. 153-166
  • Journal article (peer-reviewed)abstract
    • Given a set R of distinct, non-trivial partitions of a finite set, we define the relation graph G(R) of R. In case R consists only of bipartitions, G(R) is the well-known Buneman graph, a median graph that has applications in the area of phylogenetic analysis., Here we consider properties of the relation graph for general sets of partitions and, in particular, we see that it mimics the behaviour of the Buneman graph by proving the following two theorems:(i) The graph G(R) is a Hamming graph if and only if R is strongly incompatible.(ii) The graph G(R) is a block graph with #R blocks if and only if R is strongly compatible.
  •  
14.
  •  
15.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 11-15 of 15

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view