392011 Grundlagen der Sequenzanalyse (V) (WiSe 2006/2007)

Contents, comment

Sequenzen sind allgegenwärtig. Texte und Programme, Gene und Proteine,
Polygonzüge, Sprach- und Bildsignale und digitalisiertes Vogelzwitschern
werden dargestellt als Zeichenfolgen über einem endlichen Alphabet.
Entsprechend vielfältig sind die algorithmischen Fragestellungen. Oft
ist dabei der Datenumfang sehr groß, so dass die algorithmische
Komplexität von entscheidender praktischer Bedeutung ist.

In der Vorlesung werden Algorithmen zum effizienten Vergleich von
Sequenzen und zur Suche exakter und approximativer Muster in Sequenzen
behandelt. Viele dieser Algorithmen sind durch bioinformatische
Fragestellungen motiviert. Sie finden jedoch auch Anwendungen in anderen
Bereichen wie z.B. der Textverarbeitung und der Datenkompression.

Requirements for participation, required level

Algorithmen und Datenstrukturen I & II

Bibliography

  • Skript zur Vorlesung
  • Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer

Science and Computational Biology. Cambridge University Press, New York,
1997.

  • Setubal, J. and Meidanis, J.: Introduction to Computational Biology. PWS

Publishing, Boston, M.A., 1997.

Teaching staff

Dates ( Calendar view )

Frequency Weekday Time Format / Place Period  

Show passed dates >>

Subject assignments

Degree programme/academic programme Validity Variant Subdivision Status Semester LP  
Bioinformatik und Genomforschung / Bachelor (Enrollment until SoSe 2011) Sequenzanalyse Pflicht 3. benotet 5 LP für V+Ü  
Graduate School in Bioinformatics and Genome Research / Promotion    
Informatik / Bachelor (Enrollment until SoSe 2011) Nebenfach Sequenzanalyse Wahlpflicht 5. benotet 5 LP für V+Ü  
Naturwissenschaftliche Informatik / Bachelor (Enrollment until SoSe 2011) Sequenzanalyse Wahlpflicht 5. benotet 5 LP für V+Ü  
Naturwissenschaftliche Informatik / Diplom (Enrollment until SoSe 2004) BioI; allgem.HS    

No more requirements
No eLearning offering available
Registered number: 56
This is the number of students having stored the course in their timetable. In brackets, you see the number of users registered via guest accounts.
Address:
WS2006_392011@ekvv.uni-bielefeld.de
This address can be used by teaching staff, their secretary's offices as well as the individuals in charge of course data maintenance to send emails to the course participants. IMPORTANT: All sent emails must be activated. Wait for the activation email and follow the instructions given there.
If the reference number is used for several courses in the course of the semester, use the following alternative address to reach the participants of exactly this: VST_2516743@ekvv.uni-bielefeld.de
Coverage:
1 Students to be reached directly via email
Notes:
Additional notes on the electronic mailing lists
Last update basic details/teaching staff:
Friday, December 11, 2015 
Last update times:
Friday, May 19, 2006 
Last update rooms:
Thursday, June 29, 2006 
Type(s) / SWS (hours per week per semester)
lecture (V) / 2
Department
Faculty of Technology
Questions or corrections?
Questions or correction requests for this course?
Planning support
Clashing dates for this course
Links to this course
If you want to set links to this course page, please use one of the following links. Do not use the link shown in your browser!
The following link includes the course ID and is always unique:
https://ekvv.uni-bielefeld.de/kvv_publ/publ/vd?id=2516743
Send page to mobile
Click to open QR code
Scan QR code: Enlarge QR code
ID
2516743