Loading...
Please wait, while we are loading the content...
Similar Documents
Computational Biology Lecture 16 : Genome rearrangements , sorting by reversals
| Content Provider | Semantic Scholar |
|---|---|
| Author | Mneimneh, Saad |
| Copyright Year | 2004 |
| Abstract | When comparing genomes in different species, a piece of chromosome in one species can be moved or copied to a different location in another species. Therefore, we talk about genome rearragements. So far we used alignment algorithms to compare two sequences, possibly coming from different species, but alignments do not capture all genome rearragements. An alignment of two sequences determines a series of shifts (in one direction) of a sequence to bring it close to the other sequence. For instance, the following rearragement cannot be captured by an alignment: |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.cs.hunter.cuny.edu/~saad/courses/compbio/lectures/lecture16.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
