Identification of character non-independence in phylogenetic data using parallelized rule induction from coverings

Author

Bhagyesh Babubhai Patel

Keywords and Phrases

Parallelized Rule Induction from COverings (PRICO); Rule Induction from COverings (RICO)

Abstract

"Undiscovered relationships in a data set may confound analyses, particularly those that assume data independence. Such problems occur when characters used for phylogenetic analyses are not independent of one another. Although a data mining technique known as rule induction from coverings has earlier been shown to be a promising approach for identifying such non-independence, its inherent computational complexity has limited its application for even small phylogenetic data sets. Herein we test the hypothesis that parallelizing the rule induction from coverings strategy as well as applying heuristics to some facets of the algorithm will overcome these limitations of scalability and efficiency"--Abstract, page iii.

Advisor(s)

Leopold, Jennifer
Erçal, Fikret

Committee Member(s)

Thakur, Mayur
Maglia, Anne M.

Department(s)

Computer Science

Degree Name

M.S. in Computer Science

Publisher

University of Missouri--Rolla

Publication Date

Fall 2006

Pagination

vii, 53 pages

Rights

© 2006 Bhagyesh Babubhai Patel, All rights reserved.

Document Type

Thesis - Citation

File Type

text

Language

English

Subject Headings

Data mining
Phylogeny

Thesis Number

T 9095

Print OCLC #

124049263

Link to Catalog Record

Full-text not available: Request this publication directly from Missouri S&T Library or contact your local library.

Recommended Citation

Patel, Bhagyesh Babubhai, "Identification of character non-independence in phylogenetic data using parallelized rule induction from coverings" (2006). Masters Theses. 5886.
https://scholarsmine.mst.edu/masters_theses/5886