• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1097
  • 256
  • 149
  • 85
  • 77
  • 47
  • 39
  • 23
  • 23
  • 22
  • 22
  • 22
  • 22
  • 22
  • 22
  • Tagged with
  • 2214
  • 315
  • 304
  • 174
  • 172
  • 168
  • 149
  • 147
  • 141
  • 135
  • 130
  • 125
  • 123
  • 122
  • 121
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
81

Extracting conflict-free information from multi-labeled trees

Deepak, Akshay, Fernandez-Baca, David, McMahon, Michelle January 2013 (has links)
BACKGROUND:A multi-labeled tree, or MUL-tree, is a phylogenetic tree where two or more leaves share a label, e.g., a species name. A MUL-tree can imply multiple conflicting phylogenetic relationships for the same set of taxa, but can also contain conflict-free information that is of interest and yet is not obvious.RESULTS:We define the information content of a MUL-tree T as the set of all conflict-free quartet topologies implied by T, and define the maximal reduced form of T as the smallest tree that can be obtained from T by pruning leaves and contracting edges while retaining the same information content. We show that any two MUL-trees with the same information content exhibit the same reduced form. This introduces an equivalence relation among MUL-trees with potential applications to comparing MUL-trees. We present an efficient algorithm to reduce a MUL-tree to its maximally reduced form and evaluate its performance on empirical datasets in terms of both quality of the reduced tree and the degree of data reduction achieved.CONCLUSIONS:Our measure of conflict-free information content based on quartets is simple and topologically appealing. In the experiments, the maximally reduced form is often much smaller than the original tree, yet retains most of the taxa. The reduction algorithm is quadratic in the number of leaves and its complexity is unaffected by the multiplicity of leaf labels or the degree of the nodes.
82

The growth of tree seedlings in relation to the effect of a grass cover

Chinner, John Harding January 1948 (has links)
No description available.
83

The taxonomy of British elms

Armstrong, Jayne Vanessa January 1992 (has links)
No description available.
84

Drought Tolerant Trees for Mid-elevation Deserts of Arizona (3,000 to 4,000 feet)

Schalau, Jeff 07 1900 (has links)
2 pp.
85

Selecting, Planting and Staking Trees (PowerPoint)

Schuch, Ursula, Kelly, Jack 03 1900 (has links)
39 slides / Planting Guidelines; Container Trees and Shrubs (1998) Plant Selection and Selecting your Plants (2000) Selecting, Planting and Caring for Landscape Trees (DVD and VHS (2003); Originally published: 2006 / This slide set with accompanying notes is intended to educate profesisonals in the nursery and landscape trade and lay people interested in proper horticultural practices related to selecting, planting and staking trees.
86

The development of urban forestry in Britain and Ireland

Johnston, Mark January 1999 (has links)
No description available.
87

Population studies of arthropods on apple trees in North-East England, with particular reference to mussel scale, Lepidosaphes ulmi (L.)

Farooq-Ahmad, Khawaja January 1995 (has links)
No description available.
88

Micropropagation of the tropical hardwoods, Khaya ivorensis A. Chev. and Nauclea diderrichii (De Wild and Th. Dur.) Merrill

Mathias, P. J. January 1988 (has links)
No description available.
89

The reproductive biology of Artocarpus heterophyllus Lam

Pushpakumara, D. K. N. G. January 1997 (has links)
No description available.
90

A study of the reproductive biology of Cordia alliodora (R. and P.) Oken

Boshier, David Henry January 1992 (has links)
No description available.

Page generated in 0.2147 seconds