Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/169292
Title: | On parsimony and clustering | Authors: | Oggier, Frederique Datta, Anwitaman |
Keywords: | Engineering::Computer science and engineering | Issue Date: | 2023 | Source: | Oggier, F. & Datta, A. (2023). On parsimony and clustering. PeerJ Computer Science, 9, e1339-. https://dx.doi.org/10.7717/peerj-cs.1339 | Journal: | PeerJ Computer science | Abstract: | This work is motivated by applications of parsimonious cladograms for the purpose of analyzing non-biological data. Parsimonious cladograms were introduced as a means to help understanding the tree of life, and are now used in fields related to biological sciences at large, e.g., to analyze viruses or to predict the structure of proteins. We revisit parsimonious cladograms through the lens of clustering and compare cladograms optimized for parsimony with dendograms obtained from single linkage hierarchical clustering. We show that despite similarities in both approaches, there exist datasets whose clustering dendogram is incompatible with parsimony optimization. Furthermore, we provide numerical examples to compare via F-scores the clustering obtained through both parsimonious cladograms and single linkage hierarchical dendograms. | URI: | https://hdl.handle.net/10356/169292 | ISSN: | 2376-5992 | DOI: | 10.7717/peerj-cs.1339 | Schools: | School of Computer Science and Engineering School of Physical and Mathematical Sciences |
Rights: | © 2023 Oggier and Datta. Distributed under Creative Commons CC-BY 4.0. | Fulltext Permission: | open | Fulltext Availability: | With Fulltext |
Appears in Collections: | SCSE Journal Articles SPMS Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
peerj-cs-1339.pdf | 2.84 MB | Adobe PDF | ![]() View/Open |
SCOPUSTM
Citations
50
1
Updated on Mar 24, 2025
Page view(s)
129
Updated on Mar 26, 2025
Download(s) 50
62
Updated on Mar 26, 2025
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.