Polycarpaea
Polycarpaea is a genus of plants in the family Caryophyllaceae. The genus was named by Jean-Baptiste Lamarck in 1792.
| Polycarpaea | |
|---|---|
 | |
| Polycarpaea filifolia | |
Scientific classification  | |
| Kingdom: | Plantae |
| Clade: | Tracheophytes |
| Clade: | Angiosperms |
| Clade: | Eudicots |
| Order: | Caryophyllales |
| Family: | Caryophyllaceae |
| Genus: | Polycarpaea Lam., 1792 |
Polycarpaea corymbosa
Molecular phylogenetic analysis showed that the genus is polyphyletic and needs to be redefined. It falls into three distinct clades. One of these, a group of species related to P. corymbosa, has acquired the C4 photosynthetic pathway.[1]
Selected species
It contains the following species (but this list may be incomplete):
- Polycarpaea akkensis Maire.
- Polycarpaea aristata Chr.Sm.
- Polycarpaea balfourii Briq.
- Polycarpaea caespitosa Balf.f.
- Polycarpaea carnosa Chr.Sm.
- Polycarpaea clavifolia M.Gilbert.
- Polycarpaea corymbosa (L.) Lam.
- Polycarpaea divaricata Aiton.
- Polycarpaea filifolia Webb ex Christ.
- Polycarpaea gaudichaudii Gagnepain.
- Polycarpaea gayi Webb.
- Polycarpaea guardafuiensis M.Gilbert.
- Polycarpaea hassalensis D.F.Chamb.
- Polycarpaea hayoides D.F.Chamb.
- Polycarpaea kuriensis Wagner
- Polycarpaea latifolia Poiret.
- Polycarpaea nivea Aiton.
- Polycarpaea paulayana Wagner
- Polycarpaea pulvinata M.Gilbert.
- Polycarpaea repens (Forsskal) Ascherson & Schweinf.
- Polycarpaea robbairea (Kunze) Greuter & Burdet.
- Polycarpaea smithii Link.
- Polycarpaea somalensis Engl.
- Polycarpaea spicata Wight ex Arn.
- Polycarpaea tenuis Webb ex Christ.
- Polycarpaea ventiversa M.Gilbert.
gollark: Nope! Many languages, abstractly speaking, *don't* have limited memory. Their implementations might, though.
gollark: No, Turing completeness means it can simulate any Turing machine. It *can't* do that if it has limited memory.
gollark: I don't know exactly what its instruction set is like. But if it has finite-sized addresses, it can probably access finite amounts of memory, and thus is not Turing-complete.
gollark: *Languages* can be, since they often don't actually specify memory limits, implementations do.
gollark: It's not Turing-complete if it has limited memory.
References
- Kool, Annaleen (2012). Desert plants and deserted islands: systematics and ethnobotany in Caryophyllaceae (PhD thesis). Uppsala University. pp. 35–36. ISBN 978-91-554-8471-2. Retrieved 23 June 2018.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.