This outline is also available in PDF.
Held: Thursday, 6 October 2011
Summary: We consider ways in which we can computationally identify genes (or sequences likely to be genes) in longer DNA sequences.
Algorithm ShortSuperString(S) Input S, a set of strings Output super, a single string Every string in S appears somewhere in super Begin Let super be a largest element of S. Remove super from S. while strings remain in S find s, the string in S that best aligns with super remove s from S super = align(super, s) return super End
Begin while S contains more than one string pick, s1 and s2, the two strings in S that best align remove s1 and s2 from S add align(s1,s2) to S return S End
Intentionally left nearly blank.
patternsthat indicate genes
I usually create these pages
on the fly, which means that I rarely
proofread them and they may contain bad grammar and incorrect details.
It also means that I tend to update them regularly (see the history for
more details). Feel free to contact me with any suggestions for changes.
This document was generated by
Siteweaver on Tue Nov 22 13:06:02 2011.
The source to the document was last modified on Mon Aug 22 11:16:58 2011.
This document may be found at
You may wish to validate this document's HTML ; ;Samuel A. Rebelsky, email@example.com
http://creativecommons.org/licenses/by-nc/2.5/or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.