====== Bioinformatics Journal Club ======
\\ 


|392169 |Feijão |Summer 2013 |Thursday 18-20 in U10-155 |[[http://ekvv.uni-bielefeld.de/kvv_publ/publ/vd?id=36919093|ekvv]] |

===== Contents =====
In this seminar we read and discuss current research articles from different fields in bioinformatics. 



===== Topics =====
This semester, the articles will be selected from the [[http://link.springer.com/journal/453|Algorithmica]] Journal, and  we will focus on articles with 100+ citations. We are using two citations databases to find the most cited papers: 


  * [[http://apps.webofknowledge.com|Web of Knowledge]]: To see the list, go to [[http://apps.webofknowledge.com|Web of Knowledge]] and search for "Algorithmica" in the field "Publication Name", and then sort by "Times cited". 
  * [[http://academic.research.microsoft.com|Microsoft Academic Search]]: use this [[http://academic.research.microsoft.com/Detail?entitytype=4&searchtype=2&id=234&orderBy=1|link]]. 


===== Schedule =====

| **Date** | **Topic** | **Name** | **Article** |
| 11.04.2013 | Preliminaries | Pedro Feijão | --- |
| 18.04.2013 | Algorithmica papers with 100+ citations | Roland Wittler | Fortune, S. (1987). [[http://link.springer.com/article/10.1007%2FBF01840357?LI=true|A sweepline algorithm for Voronoi diagrams]]. Algorithmica, 2(1-4), 153–174. {{ 936fortune-1987-voronoi.pdf | [PDF] }} |
| 25.04.2013 | Algorithmica papers with 100+ citations | Annelyse Thévenin |Ukkonen, E. (1995). [[http://link.springer.com/article/10.1007%2FBF01206331|On-line construction of suffix trees]]. Algorithmica, 14(3), 249–260. {{ 9361995-Ukkonen-suffix-trees.pdf | [PDF] }} |
| 02.05.2013 | (too close to a holiday) |--- |--- |
| 09.05.2013 | (Himmelfahrt) | --- |--- |
| 16.05.2013 | Algorithmica papers with 100+ citations | Pedro Feijão |Myers, E. (1986). [[http://link.springer.com/article/10.1007/BF01840446|An O(ND) difference algorithm and its variations]]. Algorithmica, 1(1-4), 251–266.  {{ 936myers-1986-difference-algorithm.pdf | [PDF] }}|
| 23.05.2013 | Algorithmica papers with 100+ citations | --- | Postponed to 20.06 |
| 30.05.2013 | (Fronleichnam) | --- |--- |
| 06.06.2013 |Algorithmica papers with 100+ citations | Christina Ander | Chew, L. (1989). [[http://link.springer.com/article/10.1007/BF01553881|Constrained delaunay triangulations]]. Algorithmica, (1-4), 97–108.     {{ 9361989-chew-Constrained-Delaunay-Triangulation.pdf | [PDF] }} |
| 13.06.2013 | Algorithmica papers with 100+ citations | Jens Stoye | Kececioglu, J. & Sankoff, D. (1995). [[http://link.springer.com/article/10.1007/BF01188586|Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement]]. Algorithmica, 13(1/2), 180-210.  {{ 9361995_Kececioglu_Sankoff.pdf | [PDF] }}|
| 20.06.2013 | Algorithmica papers with 100+ citations | Kai Bernd Stadermann |Nagamochi, H., & Ibaraki, T. (1992). [[http://link.springer.com/article/10.1007/BF01758778|A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph]]. Algorithmica, 7, 583–596.  {{ 936nagamochi-ibaraki-1992-sparse-k-connected-subgraph.pdf | [PDF] }} |
| 27.06.2013 | --- |--- |--- |
| 04.07.2013 | Algorithmica papers with 100+ citations | Daniel Dörr | Feige, U., Peleg, D., & Kortsarz, G. (2001). [[http://link.springer.com/article/10.1007/s004530010050|The Dense k -Subgraph Problem]]. Algorithmica, 29(3), 410–421. {{ 936feige-peleg-kortsarz-2001-dense-k-subgraph.pdf | [PDF] }} |
| 11.07.2013 | (AGGI Sommerausflug) | --- |--- |
| 18.07.2013 | (DiDy Application Workshop) |--- |--- |
| 26.09.2013 | --- | Katharina Jahn | [[http://link.springer.com/article/10.1007/BF01188580|Combinatorial algorithms for DNA sequence assembly]],  J. D. Kececioglu, E. W. Myers, Algorithmica, February 1995, Volume 13, Issue 1-2, pp 7-51  {{ 936kececioglu-myers-1995-combinatorial-alg-for-dna-assembly.pdf | [PDF] }} |Back to [[:Teaching|Teaching]]