Genome-scale algorithmics

RSS feed of this list

  1. Approximate string matching with reduced alphabet

    Salmela, L. & Tarhio, J., 2010, Algorithms and applications: Essays dedicated to Esko Ukkonen on the occasion of his 60th birthday. Elomaa, T., Mannila, H. & Orponen, P. (eds.). Springer-Verlag, 11 p. (Lecture Notes in Computer Science; vol. 2010, no. 6060).

    Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

  2. Normalized N50 Assembly Metric using Gap-Restricted Co-Linear Chaining

    Mäkinen, V., Salmela, L. & Ylinen, J., 3 Oct 2012, In : BMC Bioinformatics. 13, p. 255 5 p.

    Research output: Contribution to journalArticleScientificpeer-review

  3. Crochemore’s String Matching Algorithm: Simplification, Extensions, Applications

    Kärkkäinen, J., Kempa, D. & Puglisi, S., 2013, Proceedings of the Prague Stringology Conference 2013. Holub, J. & Žďárek, J. (eds.). Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology, p. 168-175 8 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  4. On the complexity of Minimum Path Cover with Subpath Constraints for multi-assembly

    Rizzi, R., Tomescu, A. I. & Mäkinen, V., 10 Sep 2014, In : BMC Bioinformatics. 15, S9, p. S5

    Research output: Contribution to journalArticleScientificpeer-review

  5. The representation of Boolean algebras in the spotlight of a proof checker

    Ceterchi, R., Omodeo, E. G. & Tomescu, A. I., 2014, Proceedings of the 29th Italian Conference on Computational Logic: Torino, Italy, June 16-18, 2014. Giordano, L., Gliozzi, V. & Pozzato, G. L. (eds.). CEUR Workshop Proceedings, p. 287-301 15 p. (CEUR Workshop Proceedings; vol. 1195).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  6. LoRDEC: accurate and efficient long read error correction

    Salmela, L. & Rivals, E., 2014, In : Bioinformatics. 30, 24, p. 3506-3514 8 p.

    Research output: Contribution to journalArticleScientificpeer-review

  7. Closed Factorization

    Badkobeh, G., Bannai, H., Goto, K., I, T., Iliopoulos, C. S., Inenaga, S., Puglisi, S. J. & Sugimoto, S., 2014, Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, September 1-3, 2014. Holub, J. & Zdárek, J. (eds.). Prague: Czech Technical University in Prague, Department of Theoretical Computer Science, Faculty of Information Technology, p. 162-168 7 p.

    Research output: Chapter in Book/Report/Conference proceedingChapterScientific

  8. Linear time construction of compressed text indices in compact space

    Belazzougui, D., Jun 2014, STOC '14- Proceedings of the 46th Annual ACM Symposium on Theory of Computing. Shmoys, D. B. (ed.). New York: ACM, p. 184-193 10 p. (Proceedings of the annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

  9. Flight-induced changes in gene expression in the Glanville fritillary butterfly

    Kvist, J., Mattila, A. L. K., Somervuo, P., Ahola, V., Koskinen, P., Paulin, L., Salmela, L., Fountain, T., Rastas, P., Ruokolainen, A., Taipale, M., Holm, L., Auvinen, P., Lehtonen, R., Frilander, M. J. & Hanski, I., Oct 2015, In : Molecular Ecology. 24, 19, p. 4886-4900 15 p.

    Research output: Contribution to journalArticleScientificpeer-review

  10. Graph operations on parity games and polynomial-time algorithms

    Dittmann, C., Kreutzer, S. & Tomescu, A. I., 8 Feb 2016, In : Theoretical Computer Science. 614, p. 97-108 12 p.

    Research output: Contribution to journalArticleScientificpeer-review

Previous 1 2 3 4 5 6 7 8 ...20 Next