The analysis of small circular sequences requires specialized tools. While
the differences between linear and circular sequences can be neglected in the case of long molecules such as bacterial genomes since in practice all analysis is performed in sequence windows, this is not true for viroids and related sequences which are usually only a few hundred basepairs long. In this contribution we present basic algorithms and corresponding software for circular RNAs. In particular, we discuss the problem of pairwise and multiple cyclic sequence alignments with affine gap costs, and an extension of a recent approach to circular RNA folding to the computation of consensus structures.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:32019 |
| Date | 25 October 2018 |
| Creators | Mosig, Axel, Hofacker, Ivo L., Stadler, Peter F. |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | info:eu-repo/semantics/publishedVersion, doc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 978-3-88579-177-5 |
Page generated in 0.0021 seconds