BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:US/Pacific
BEGIN:DAYLIGHT
DTSTART:20220313T030000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:PDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20221106T010000
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:PST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20220502T044428Z
UID:6A137280-D6E3-4786-A66C-9FC9AC395AF1
DTSTART;TZID=US/Pacific:20220427T160000
DTEND;TZID=US/Pacific:20220427T170000
DESCRIPTION:Phylogeny is the evolutionary history of a species or group of 
 organisms. Evolutionary trees can be analogized to graph trees\, thus dete
 rmination of these structures aids in inferring the evolutionary history o
 f groups of organisms\, extant and extinct. K-leaf power graphs enhance th
 e ability of researchers to map paralogous and xenologous speciation event
 s in what is a considerably difficult area to correctly predict past relat
 ionships.\n\nForbidden subgraph characterization is a method by which to c
 haracterize a graph class with a set of graphs that do not belong to that 
 class. Identification of minimal forbidden induced subgraphs is one method
  of characterizing the k-leaf powers of graph trees. A tree is a k-leaf po
 wer if\, and only if\, the leaves are connected by at most distance k. Str
 uctures for 2-leaf\, 3-leaf\, and 4-leaf powers are well understood\, howe
 ver\, there does not exist a published list of forbidden subgraph leaf pow
 ers for values of k ≥ 4. In service of cladistics\, k-leaf powers are fr
 equently edited by adding or removing nodes and edges to the closest “pr
 oper” representation of a pairwise comparison of groups of organisms.\n\
 nWe demonstrate a deterministic\, reductionist approach to generating 4-le
 af\, 5-leaf\, and 6-leaf powers using Python\, the graph library Networkx\
 , and the Nauty suite of graph generation and labelling programs. The list
  of non-k-leaf powers in this range has not been proven finite\, so this a
 pproach does not cover all possible structures should the list be infinite
 .\n\nCo-sponsored by: Okanagan College\n\nSpeaker(s): Evan MacKinnon\, Dak
 ota Joiner\n\nRoom: E102\, Bldg: E \, 1000 KLO Rd.\, Okanagan College \, K
 elowna\, British Columbia\, Canada\, V1Y 4X8\, Virtual: https://events.vto
 ols.ieee.org/m/312801
LOCATION:Room: E102\, Bldg: E \, 1000 KLO Rd.\, Okanagan College \, Kelowna
 \, British Columbia\, Canada\, V1Y 4X8\, Virtual: https://events.vtools.ie
 ee.org/m/312801
ORGANIZER:youry@ieee.org
SEQUENCE:9
SUMMARY:An approach towards generating k-leaf powers for phylogenetic tree 
 construction
URL;VALUE=URI:https://events.vtools.ieee.org/m/312801
X-ALT-DESC:Description: <br /><p>Phylogeny is the evolutionary history of a
  species or group of organisms. Evolutionary trees can be analogized to gr
 aph trees\, thus determination of these structures aids in inferring the e
 volutionary history of groups of organisms\, extant and extinct. K-leaf po
 wer graphs enhance the ability of researchers to map paralogous and xenolo
 gous speciation events in what is a considerably difficult area to correct
 ly predict past relationships.</p>\n<p>Forbidden subgraph characterization
  is a method by which to characterize a graph class with a set of graphs t
 hat do not belong to that class. Identification of minimal forbidden induc
 ed&nbsp\;subgraphs is one method of characterizing the k-leaf powers of gr
 aph trees. A tree is a k-leaf power if\, and only if\, the leaves are conn
 ected by at most distance k. Structures for 2-leaf\, 3-leaf\, and 4-leaf p
 owers are well understood\, however\, there does not exist a published lis
 t of forbidden subgraph leaf powers for values of k &ge\; 4. In service of
  cladistics\, k-leaf powers are frequently edited by adding or removing no
 des and edges to the closest &ldquo\;proper&rdquo\; representation of a pa
 irwise comparison of groups of organisms.</p>\n<p>We demonstrate a determi
 nistic\, reductionist approach to generating 4-leaf\, 5-leaf\, and 6-leaf 
 powers using Python\, the graph library Networkx\, and the Nauty suite of 
 graph generation and labelling programs. The list of non-k-leaf powers in 
 this range has not been proven finite\, so this approach does not cover al
 l possible structures should the list be infinite.</p>
END:VEVENT
END:VCALENDAR