1 - 10 out of 47Page size: 10
  1. 2021

  2. Efficient Parallel Algorithms for String Comparison

    Mishin, N., Berezun, D. & Tiskin, A., 9 Aug 2021, 50th International Conference on Parallel Processing, ICPP 2021 - Main Conference Proceedings. Association for Computing Machinery, 10 p. 50. (ACM International Conference Proceeding Series).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  3. 2020

  4. Communication vs Synchronisation in Parallel String Comparison

    Tiskin, A., 6 Jul 2020, SPAA 2020 - Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 479-489 11 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  5. 2019

  6. Bounded-length Smith-Waterman alignment

    Tiskin, A., Sep 2019, 19th International Workshop on Algorithms in Bioinformatics, WABI 2019. Huber, K. T. & Gusfield, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 143).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  7. 2015

  8. Fast Distance Multiplication of Unit-Monge Matrices

    Tiskin, A., 1 Apr 2015, In: Algorithmica. 71, 4, p. 859-888 30 p.

    Research output: Contribution to journal › Article › peer-review

  9. 2014

  10. Four-point conditions for the TSP: The complete complexity classification

    Deineko, V. G., Klinz, B., Tiskin, A. & Woeginger, G. J., 1 Nov 2014, In: Discrete Optimization. 14, p. 147-159 13 p.

    Research output: Contribution to journal › Article › peer-review

  11. State-of-the-art in string similarity search and join

    Wandelt, S., Deng, D., Gerdjikov, S., Mishra, S., Mitankin, P., Patil, M., Siragusa, E., Tiskin, A., Wang, W., Wang, J. & Leser, U., 1 Jan 2014, In: SIGMOD Record. 43, 1, p. 64-76 13 p.

    Research output: Contribution to journal › Article › peer-review

  12. Threshold approximate matching in grammar-compressed strings

    Tiskin, A., 1 Jan 2014, Proceedings of the Prague Stringology Conference 2014, PSC 2014. p. 124-138 15 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  13. 2013

  14. Parallel suffix array construction by accelerated sampling

    Pace, M. F. & Tiskin, A., 1 Oct 2013, Proceedings of the Prague Stringology Conference 2013, PSC 2013. p. 142-156 15 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  15. Efficient high-similarity string comparison: The waterfall algorithm

    Tiskin, A., 2 May 2013, ACM International Conference Proceeding Series. p. 358-365 8 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  16. 2012

  17. Conserved noncoding sequences highlight shared components of regulatory networks in dicotyledonous plants

    Baxter, L., Jironkin, A., Hickman, R., Moore, J., Barrington, C., Krusche, P., Dyer, N. P., Buchanan-Wollaston, V., Tiskin, A., Beynon, J., Denby, K. & Ott, S., 1 Jan 2012, In: Plant Cell. 24, 10, p. 3949-3965 17 p.

    Research output: Contribution to journal › Article › peer-review

Previous 1 2 3 4 5 Next

ID: 61693969