Return to search

Detection of non-coding RNA with comparative genomics and the sequential closure of smooth graphs in Cartesian currents

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2003. / Includes bibliographical references (p. 95-99). / In the field of genomics, this thesis presents algorithms for identifying non-coding RNA (ncRNA) genes. It describes a rapid and highly reliable comparative statistical method for identification of functionally significant base pairs in ncRNA genes in multiple sequence alignments of cross-species homologs, a divide-and-conquer approach to optimal assembly of exon predictions with O(n log n) time-complexity, (the standard algorithm for exon assembly has O(n²) time-complexity for ncRNA exon predictions,) and highly accurate statistical tests for exon boundaries based on recognition of non-contiguous patterns in known examples. It also describes a method for scanning cDNA for ncRNA genes. In the field of geometric measure theory, it proves that the set of cartesian currents given by integration over the graphs of smooth functions is dense in the set of all cartesian currents. / by Alex Coventry. / Ph.D.

Identiferoai:union.ndltd.org:MIT/oai:dspace.mit.edu:1721.1/30071
Date January 2003
CreatorsCoventry, Alex, 1972-
ContributorsBonnie Berger., Massachusetts Institute of Technology. Dept. of Mathematics., Massachusetts Institute of Technology. Dept. of Mathematics.
PublisherMassachusetts Institute of Technology
Source SetsM.I.T. Theses and Dissertation
LanguageEnglish
Detected LanguageEnglish
TypeThesis
Format99 p., 3240644 bytes, 3240452 bytes, application/pdf, application/pdf, application/pdf
RightsM.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission., http://dspace.mit.edu/handle/1721.1/7582

Page generated in 0.0021 seconds