Download Computational Biology

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the work of artificial intelligence, which forms the content of this project

Document related concepts

Segmental Duplication on the Human Y Chromosome wikipedia , lookup

Genetic engineering wikipedia , lookup

Ridge (biology) wikipedia , lookup

Copy-number variation wikipedia , lookup

No-SCAR (Scarless Cas9 Assisted Recombineering) Genome Editing wikipedia , lookup

Maximum parsimony (phylogenetics) wikipedia , lookup

Human genetic variation wikipedia , lookup

Gene wikipedia , lookup

Gene desert wikipedia , lookup

Polyploid wikipedia , lookup

Gene expression profiling wikipedia , lookup

Quantitative comparative linguistics wikipedia , lookup

Transposable element wikipedia , lookup

Oncogenomics wikipedia , lookup

RNA-Seq wikipedia , lookup

Mitochondrial DNA wikipedia , lookup

Genomic imprinting wikipedia , lookup

History of genetic engineering wikipedia , lookup

Artificial gene synthesis wikipedia , lookup

NUMT wikipedia , lookup

Non-coding DNA wikipedia , lookup

Gene expression programming wikipedia , lookup

ENCODE wikipedia , lookup

Designer baby wikipedia , lookup

Microevolution wikipedia , lookup

Metagenomics wikipedia , lookup

Public health genomics wikipedia , lookup

Genome (book) wikipedia , lookup

Whole genome sequencing wikipedia , lookup

Computational phylogenetics wikipedia , lookup

Genomic library wikipedia , lookup

Human genome wikipedia , lookup

Site-specific recombinase technology wikipedia , lookup

Helitron (biology) wikipedia , lookup

Genome editing wikipedia , lookup

Genomics wikipedia , lookup

Minimal genome wikipedia , lookup

Pathogenomics wikipedia , lookup

Human Genome Project wikipedia , lookup

Genome evolution wikipedia , lookup

Transcript
Ancestral median for human, mouse, and cat
Problem: comparative maps usually correspond to unsigned permutations = no
direction is available on the orientation of the genes.
Note that the algorithmic complexity of this problem is NP-hard.
Therefore assign orientation to markers.
Use strips in unsigned permutations to infer the signed permutations from the
original unsigned permutations.
Using the human genome as a reference, all strips in both mouse and and cat
genomes were identified and assigned an orientation.
Any marker where no orientation could be assigned (79) was removed.
This is an application to a multichromosomal problem.
7. Lecture WS 2003/04
Bioinformatics III
32