dc.contributor.authorDu, Zhihuaen_US
dc.date.accessioned2011-12-27T08:25:42Z
dc.date.accessioned2017-07-23T08:29:26Z
dc.date.available2011-12-27T08:25:42Z
dc.date.available2017-07-23T08:29:26Z
dc.date.copyright2005
dc.date.issued2005
dc.identifier.citationDu, Z. (2005). High performance computing for computational biology. Doctoral thesis, Nanyang Technological University, Singapore.
dc.identifier.urihttp://hdl.handle.net/10356/47481
dc.description182 p.en_US
dc.description.abstractBoth sequence comparison and phylogenetic inference are of great importance to biologists; and these problems are fundamentally interdependent. Most methods for phylogenetic inference use a given sequence alignment as an input, and efficient multiple alignment procedures often take advantage of a phylogenetic relationship of the sequences. However, the algorithms used in these problems are very computationally demanding. Also, the huge increase in size of publicly available genomic data has meant that many common tasks in bioinformatics are not possible to complete in a reasonable amount of time on a single processor. For example, inferring phylogenetic trees is an enormously difficult problem because of the huge number of potential alternative tree topologies, for that number grows exponentially.en_US
dc.rightsNanyang Technological Universityen_US
dc.subjectDRNTU::Engineering::Computer science and engineering::Computer systems organization::Special-purpose and application-based systemsen_US
dc.titleHigh performance computing for computational biologyen_US
dc.typeThesisen_US
dc.contributor.schoolSchool of Computer Engineeringen_US
dc.contributor.supervisorLin Fengen_US
dc.description.degreeDOCTOR OF PHILOSOPHY (SCE)en_US


Files in this item

FilesSizeFormatView
SCE_THESES_23.pdf19.82Mbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record