Author:
Gibney Daniel,Thankachan Sharma V.,Aluru Srinivas
Publisher
Springer International Publishing
Reference46 articles.
1. Abboud, A., Backurs, A., Hansen, T.D., Williams, V.V., Zamir, O.: Subtree isomorphism revisited. ACM Trans. Algorithms 14(3), 27:1—27:23 (2018). https://doi.org/10.1145/3093239
2. Abrahamson, K.R.: Generalized string matching. SIAM J. Comput. 16(6), 1039–1051 (1987). https://doi.org/10.1137/0216067
3. Alanko, J., D’Agostino, G., Policriti, A., Prezza, N.: Wheeler languages. CoRR abs/2002.10303 (2020). https://arxiv.org/abs/2002.10303
4. Alanko, J.N., Gagie, T., Navarro, G., Benkner, L.S.: Tunneling on wheeler graphs. In: Data Compression Conference, DCC 2019, Snowbird, UT, USA, 26–29 March 2019. pp. 122–131 (2019). https://doi.org/10.1109/DCC.2019.00020
5. Almodaresi, F., Sarkar, H., Srivastava, A., Patro, R.: A space and time-efficient index for the compacted colored de Bruijn graph. Bioinform 34(13), i169–i177 (2018). https://doi.org/10.1093/bioinformatics/bty292
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献