Professional Documents
Culture Documents
[Download pdf] Research In Computational Molecular Biology 19Th Annual International Conference Recomb 2015 Warsaw Poland April 12 15 2015 Proceedings 1St Edition Teresa M Przytycka Eds online ebook all chapter pdf
[Download pdf] Research In Computational Molecular Biology 19Th Annual International Conference Recomb 2015 Warsaw Poland April 12 15 2015 Proceedings 1St Edition Teresa M Przytycka Eds online ebook all chapter pdf
https://textbookfull.com/product/e-technologies-6th-
international-conference-mcetech-2015-montreal-qc-canada-
may-12-15-2015-proceedings-1st-edition-morad-benyoucef/
https://textbookfull.com/product/mathematics-of-program-
construction-12th-international-conference-mpc-2015-konigswinter-
germany-june-29-july-1-2015-proceedings-1st-edition-ralf-hinze/
Research
LNBI 9029
in Computational
Molecular Biology
19th Annual International Conference, RECOMB 2015
Warsaw, Poland, April 12–15, 2015
Proceedings
123
Lecture Notes in Bioinformatics 9029
Research
in Computational
Molecular Biology
19th Annual International Conference, RECOMB 2015
Warsaw, Poland, April 12–15, 2015
Proceedings
ABC
Editor
Teresa M. Przytycka
National Center for Biotechnology Information
Bethesda
Maryland
USA
The RECOMB conference series – with the full name of the Annual International Con-
ference on Research in Computational Molecular Biology – was started in 1997 by
Sorin Istrail, Pavel Pevzner, and Michael Waterman. The 19th RECOMB conference,
RECOMB 2015, was held in Warsaw, Poland during April 12–15, 2015 and was hosted
by the University of Warsaw.
This volume contains the 36 extended abstracts selected for oral presentation at RE-
COMB 2015 by the Program Committee (PC) out of 170 submissions. Each submission
was assigned to at least three PC members and reviewed with the help of many exter-
nal reviewers. Following the initial reviews, there was an extensive discussion of the
submissions among the members of the PC, leading to the final decisions.
In 2015 RECOMB allowed for parallel submissions to the proceedings and a jour-
nal. Papers accepted for oral presentation that have simultaneously been submitted to a
journal are published as 2-page abstracts. Parallel submissions which have not appeared
in a journal by the time of the conference were to be deposited in the preprint server
arxiv.org. All other papers that were accepted to RECOMB 2015 were invited for sub-
mission in an edited journal version to a special issue of the Journal of Computational
Biology.
In addition to the paper presentations, RECOMB 2015 featured six invited keynote
talks by leading scientists world-wide. The keynote speakers were M. Madan Babu
(MRC Laboratory of Molecular Biology), Bonnie Berger (Broad Institute of Harvard
and MIT), M. Magda Konarska (Rockefeller University and University of Warsaw),
Michael Levitt (Stanford University), Bas van Steensel (Netherlands Cancer Institute),
and Ulam’s lecture by Waclaw Szybalski (University of Wisconsin-Madison).
Following the tradition started at RECOMB 2010, RECOMB 2015 also featured a
special highlights track containing computational biology papers that were published
in journals during the last 18 months. There were 38 submissions, 8 of which were
selected for oral presentation.
The success of RECOMB depends on the effort, dedication, and devotion of many
colleagues who have contributed to the organization of the conference. I thank the PC
members and external reviewers for the timely review of the assigned papers despite
their busy schedules; Mona Singh for chairing the highlights track; Lenore Cowen for
chairing the posters track; the Steering Committee and its chair, Martin Vingron, for
many excellent suggestions on the organization of the conference; the Local Organiz-
ing Committee members, especially the Co-chairs Jerzy Tiuryn and Bartek Wilczyński,
for hosting the conference and providing administrative, logistic, and financial sup-
port; and the authors of the papers, highlights, and posters and all the attendees for
their enthusiastic participation in the conference. We also thank our generous sponsors,
including the International Society of Computational Biology (ISCB), the US National
VI Preface
Science Foundation, the Polish Ministry of Science and Education, the Warsaw Center
for Mathematics and Computer Science, the Polish Bioinformatics Society, the Univer-
sity of Pittsburgh, and Biogen Idec. Finally, I would like to thank Roded Sharan (Tel
Aviv University; Program Chair of RECOMB 2014) for his support and advice.
Program Committee
Tatsuya Akutsu Kyoto University, Japan
Peter Arndt Max Planck Institute for Molecular Genetics,
Germany
Rolf Backofen University of Freiburg, Germany
Joel Bader Johns Hopkins University, USA
Vineet Bafna University of California, San Diego, USA
Nuno Bandeira University of California, San Diego, USA
Ziv Bar-Joseph Carnegie Mellon University, USA
Serafim Batzoglou Stanford University, USA
Jan Baumbach University of Southern Denmark, Denmark
Niko Beerenwinkel ETH Zurich, Switzerland
Panayiotis Takis Benos University of Pittsburgh, USA
Bonnie Berger Massachusetts Institute of Technology, USA
Jadwiga Bienkowska Biogen Idec, USA
Mathieu Blanchette McGill University, Canada
Jacek Błażewicz Poznań University of Technology, Poland
Michael R. Brent Washington University, St. Louis, USA
Chakra Chennubhotla University of Pittsburgh, USA
Lenore J. Cowen Tufts University, USA (Poster Chair)
Colin Dewey University of Wisconsin-Madison, USA
Dannie Durand Carnegie Mellon University, USA
Nadia El-Mabrouk Université de Montréal, Canada
Julien Gagneur Ludwig-Maximilians-Universität München,
Germany
Anna Gambin University of Warsaw, Poland
Irit Gat-Viks Tel Aviv University, Israel
Mikhail Gelfand Russian Academy of Sciences, Russia
David Gifford Massachusetts Institute of Technology, USA
Anna Goldenberg University of Toronto, Canada
Eran Halperin International Computer Science Institute, USA
Alexander Hartemink Duke University, USA
Michael Hoffman University of Toronto, Canada
Trey Ideker University of California, San Diego, USA
VIII Organization
Steering Committee
Vineet Bafna University of California, San Diego, USA
Serafim Batzoglou Stanford University, USA
Bonnie Berger Massachusetts Institute of Technology, USA
Sorin Istrail Brown University, USA
Michal Linial The Hebrew University of Jerusalem, Israel
Martin Vingron Max Planck Institute for Molecular Genetics,
Germany (Chair)
Organizing Committee
Paweł Bednarz University of Warsaw, Poland
Agata Charzyńska Polish Academy of Sciences, Poland
Norbert Dojer University of Warsaw, Poland
Anna Gambin University of Warsaw, Poland
Paweł Górecki University of Warsaw, Poland
Aleksander Jankowski University of Warsaw, Poland
Agnieszka Mykowiecka University of Warsaw, Poland
Jerzy Tiuryn University of Warsaw, Poland (Co-chair)
Irina Tuszyńska International Institute of Molecular and
Cell Biology, Poland
Bartek Wilczyński University of Warsaw, Poland (Co-chair)
Damian Wójtowicz National Institutes of Health, USA
Rafał Zaborowski University of Warsaw, Poland
X Organization
External Reviewers
Aguiar, Derek Ay, Ferhat
Ahmed, Bilal Ayati, Marzieh
Ahmed, Hazem Azizi, Elham
Akey, Joshua Barbosa, Eudes
Albrecht, Mario Batra, Richa
Alekseyev, Max Becerra, David
Alhakami, Hind Behr, Jonas
Almeida, Mathieu Bernstein, Laurence
Antczak, Maciej Bhasin, Jeffrey
Arvestad, Lars Bishara, Alex
Atias, Nir Blumer, Anselm
Organization XI
6 Conclusions
We present an efficient algorithm for the k-mismatch average common substring
problem that runs in O(n logk+1 n) time and O(n) space. This constitutes a
significant improvement over the O(n2 ) worst case run-time of the prior state
of the art. In the absence of the proposed space-saving technique, our algorithm
would have taken O(n logk n) space, which would be impractical for even small
values of k. Our algorithm achieves linear working space by decomposing the set
of modified suffixes so that they can be processed and discarded independently,
while preserving the ability to bring pairs of modified suffixes together. Note
that the biological applications of ACSk are well documented in [14]. The vastly
improved efficiency in computing ACSk by our algorithm should naturally impact
these applications positively.
A Ordering of Pairs
Consider three strings in B2 and their associated modifications.
– ({}, str1 )
– ({}, str2 )
– ({}, str3 )
References
1. Apostolico, A., Giancarlo, R.: Sequence alignment in molecular biology. Journal of
Computational Biology 5(2), 173–196 (1998)
2. Apostolico, A., Guerra, C., Pizzi, C.: Alignment free sequence similarity with
bounded hamming distance. In: DCC, pp. 183–192. IEEE (2014)
3. Asai, T., Zaporojets, D., Squires, C., Squires, C.L.: An escherichia coli strain with
all chromosomal rRNA operons inactivated: complete exchange of rRNA genes
between bacteria. National Academy of Sciences 96(5), 1971–1976 (1999)
4. Bonham-Carter, O., Steele, J., Bastola, D.: Alignment-free genetic sequence com-
parisons: a review of recent approaches by word analysis. Briefings in Bioinformat-
ics 890–905 (2013)
5. Burstein, D., Ulitsky, I., Tuller, T., Chor, B.: Information theoretic approaches
to whole genome phylogenies. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S.,
Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3500, pp.
283–295. Springer, Heidelberg (2005)
6. Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with
errors and don’t cares. In: STOC, pp. 91–100 (2004)
7. Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity
of suffix tree construction. Journal of the ACM 47(6), 987–1011 (2000)
8. Fitch, W.M., Margoliash, E., et al.: Construction of phylogenetic trees. Science
155(760), 279–284 (1967)
9. Flouri, T., Giaquinta, E., Kobert, K., Ukkonen, E.: Longest common substrings
with k mismatches. arXiv preprint (2014). arXiv:1409.1694
10. Grabowski, S.: A note on the longest common substring with k-mismatches prob-
lem. arXiv preprint (2014). arXiv:1409.7217
11. Gusfield, D.: Algorithms on strings, trees and sequences: computer science and
computational biology. University Press, Cambridge (1997)
12. Haubold, B.: Alignment-free phylogenetics and population genetics. Briefings in
Bioinformatics 15(3), 407–418 (2014)
13. Horwege, S., Lindner, S., Boden, M., Hatje, K., Kollmar, M., Leimeister, C.-A.,
Morgenstern, B.: Spaced words and kmacs: fast alignment-free sequence compari-
son based on inexact word matches. Nucleic Acids Research (2014)
14. Leimeister, C.-A., Morgenstern, B.: kmacs: the k-mismatch average common sub-
string approach to alignment-free sequence comparison. Bioinformatics (2014)
15. McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal
of the ACM 23(2), 262–272 (1976)
16. Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. In: STOC, pp.
114–122 (1981)
17. Song, K., Ren, J., Reinert, G., Deng, M., Waterman, M.S., Sun, F.: New devel-
opments of alignment-free sequence comparison: measures, statistics and next-
generation sequencing. Briefings in Bioinformatics (2013)
18. Ulitsky, I., Burstein, D., Tuller, T., Chor, B.: The average common substring app-
roach to phylogenomic reconstruction. Journal of Computational Biology 13(2),
336–350 (2006)
19. Vinga, S., Almeida, J.: Alignment-free sequence comparison - qa review. Bioinfor-
matics 19(4), 513–523 (2003)
20. Weiner, P.: Linear pattern matching algorithms. In: Switching and Automata The-
ory, pp. 1–11 (1973)
21. Zuckerkandl, E., Pauling, L.: Molecules as documents of evolutionary history.
Journal of Theoretical Biology 8(2), 357–366 (1965)
Another random document with
no related content on Scribd:
back
back
back
back
back
back
back
back
back
back
back
back
back
back
back
back
back
back
back