2026-09-19T00:19:47Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/300712022-01-13T07:54:35Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
Bonnie Berger.
Coventry, Alex, 1972-
Massachusetts Institute of Technology. Dept. of Mathematics.
Massachusetts Institute of Technology. Department of Mathematics
2006-03-24T18:16:53Z
2006-03-24T18:16:53Z
2003
2003
http://hdl.handle.net/1721.1/30071
55635853
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.
99 p.
3240644 bytes
3240452 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
M.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
Mathematics.
Detection of non-coding RNA with comparative genomics and the sequential closure of smooth graphs in Cartesian currents
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="445c08ba-4c0e-4131-be0d-a294d55d59c2">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Detection of non-coding RNA with comparative genomics and the sequential closure of smooth graphs in Cartesian currents</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2003</PublicationDate>
<Authors>
<Author>
<DisplayName>Coventry, Alex, 1972-</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Mathematics.</Keyword>
<Abstract>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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>