AlCoB 2019: call for posters*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line*
The 6th International Conference on Algorithms for Computational Biology (AlCoB 2019) invites researchers to submit poster presentations. AlCoB 2019 will be held in Berkeley on May 28-30, 2019. See
Poster presentations are intended to enhance informal interactions with conference participants, at the same time allowing for in-depth discussion.
Presentations displaying novel work in progress on algorithms in computational biology are encouraged on the following topics:
- assembling sequence reads into a complete genome,
- identifying gene structures in the genome,
- recognizing regulatory motifs,
- aligning nucleotides and comparing genomes,
- reconstructing regulatory networks of genes, and
- inferring the evolutionary phylogeny of species.
Posters do not need to show final research results. Work that might lead to new interesting developments is welcome.
Poster submission deadline: April 21, 2019
Notification of poster acceptance or rejection: April 28, 2019
Please submit a .pdf abstract through:
It should contain the title, author(s) and affiliation, and should not exceed 500 words.
Posters will be allocated 10 minutes each in the programme for oral presentation. Moreover, they will remain hanging out during the whole conference for discussion.
Posters will not appear in the LNCS/LNBI proceedings volume of AlCoB 2019. However, they will be eligible for submission to the post-conference journal special issue in IEEE/ACM Transactions on Computational Biology and Bioinformatics (2017 JCR impact factor: 2.428).
At least one author of each accepted poster must register to the conference by May 14, 2019. The registration fare is reduced: 285 Euros. It gives the same rights all other conference participants have (attendance, copy of the proceedings volume, lunches, coffee breaks). Contributors of regular papers who in addition get a poster accepted must register for the latter independently.