Identification of character non-independence in phylogenetic data using parallelized rule induction from coverings
Keywords and Phrases
Parallelized Rule Induction from COverings (PRICO); Rule Induction from COverings (RICO)
"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.
Maglia, Anne M.
M.S. in Computer Science
University of Missouri--Rolla
vii, 53 pages
© 2006 Bhagyesh Babubhai Patel, All rights reserved.
Thesis - Citation
Print OCLC #
Link to Catalog Record
Full-text not available: Request this publication directly from Missouri S&T Library or contact your local library.http://merlin.lib.umsystem.edu/record=b5849957~S5
Patel, Bhagyesh Babubhai, "Identification of character non-independence in phylogenetic data using parallelized rule induction from coverings" (2006). Masters Theses. 5886.
Share My Thesis If you are the author of this work and would like to grant permission to make it openly accessible to all, please click the button above.