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.
Main Author: | |
---|---|
Other Authors: | |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2006
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/30071 |
_version_ | 1826196252867428352 |
---|---|
author | Coventry, Alex, 1972- |
author2 | Bonnie Berger. |
author_facet | Bonnie Berger. Coventry, Alex, 1972- |
author_sort | Coventry, Alex, 1972- |
collection | MIT |
description | Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2003. |
first_indexed | 2024-09-23T10:23:58Z |
format | Thesis |
id | mit-1721.1/30071 |
institution | Massachusetts Institute of Technology |
language | eng |
last_indexed | 2024-09-23T10:23:58Z |
publishDate | 2006 |
publisher | Massachusetts Institute of Technology |
record_format | dspace |
spelling | mit-1721.1/300712019-04-12T09:42:12Z Detection of non-coding RNA with comparative genomics and the sequential closure of smooth graphs in Cartesian currents Coventry, Alex, 1972- Bonnie Berger. Massachusetts Institute of Technology. Dept. of Mathematics. Massachusetts Institute of Technology. Dept. of Mathematics. Mathematics. 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. 2006-03-24T18:16:53Z 2006-03-24T18:16:53Z 2003 2003 Thesis http://hdl.handle.net/1721.1/30071 55635853 eng 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 99 p. 3240644 bytes 3240452 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
spellingShingle | Mathematics. Coventry, Alex, 1972- Detection of non-coding RNA with comparative genomics and the sequential closure of smooth graphs in Cartesian currents |
title | Detection of non-coding RNA with comparative genomics and the sequential closure of smooth graphs in Cartesian currents |
title_full | Detection of non-coding RNA with comparative genomics and the sequential closure of smooth graphs in Cartesian currents |
title_fullStr | Detection of non-coding RNA with comparative genomics and the sequential closure of smooth graphs in Cartesian currents |
title_full_unstemmed | Detection of non-coding RNA with comparative genomics and the sequential closure of smooth graphs in Cartesian currents |
title_short | Detection of non-coding RNA with comparative genomics and the sequential closure of smooth graphs in Cartesian currents |
title_sort | detection of non coding rna with comparative genomics and the sequential closure of smooth graphs in cartesian currents |
topic | Mathematics. |
url | http://hdl.handle.net/1721.1/30071 |
work_keys_str_mv | AT coventryalex1972 detectionofnoncodingrnawithcomparativegenomicsandthesequentialclosureofsmoothgraphsincartesiancurrents |