Krzysztof Giaro - Profil naukowy - MOST Wiedzy

Wyszukiwarka

Media społecznościowe

Kontakt

Profesor zwyczajny

Katedra Algorytmów i Modelowania Systemów
Wydział Elektroniki, Telekomunikacji i Informatyki

Miejsce pracy Gmach Elektroniki Telekomunikacji i Informatyki pokój 236

Telefon (58) 347 24 28

Kierownik katedry

Katedra Algorytmów i Modelowania Systemów

Miejsce pracy Gmach Elektroniki Telekomunikacji i Informatyki pokój 236

Telefon (58) 347 24 28

Wybrane publikacje

  • Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions

    - JOURNAL OF COMPUTATIONAL BIOLOGY - 2017

    Ability to quantify dissimilarity of different phylogenetic trees describing the relationship between the same group of taxa is required in various types of phylogenetic studies. For example, such metrics are used to assess the quality of phylogeny construction methods, to define optimization criteria in supertree building algorithms, or to find horizontal gene transfer (HGT) events. Among the set of metrics described so far in...

    Pełny tekst w serwisie zewnętrznym

  • KOALA Graph Theory Internet Service

    KOALA has been created with the idea of C++ library templates, implementing a broad set of procedures in the fields of algorithmic graph theory and network problems in discreate optimization. During the C2NIWA project, a library has been greatly ectended, the code refactored and enclosed with the internet service available in the public repository of thr project. Today it contains interconnected educational materials in the form...

    Pełny tekst w serwisie zewnętrznym

  • On a matching distance between rooted phylogenetic trees

    The Robinson–Foulds (RF) distance is the most popular method of evaluating the dissimilarity between phylogenetic trees. In this paper, we define and explore in detail properties of the Matching Cluster (MC) distance, which can be regarded as a refinement of the RF metric for rooted trees. Similarly to RF, MC operates on clusters of compared trees, but the distance evaluation is more complex. Using the graph theoretic approach...

    Pełny tekst w serwisie zewnętrznym

wyświetlono 251 razy