Author:
Flouri Tomáš,Kobert Kassian,Pissis Solon P.,Stamatakis Alexandros
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: principles, techniques, and tools, 2nd edn. Addison-Wesley (2006)
2. Barstow, D.R., Shrobe, H.E., Sandewall, E.: Interactive Programming Environments. McGraw-Hill, Inc. (1984)
3. Chor, B., Tuller, T.: Finding a maximum likelihood tree is hard. Journal of ACM 53(5), 722–744 (2006)
4. Christou, M., Crochemore, M., Flouri, T., Iliopoulos, C.S., Janoušek, J., Melichar, B., Pissis, S.P.: Computing all subtree repeats in ordered trees. Information Processing Letters 112(24), 958–962 (2012)
5. Lecture Notes in Computer Science;M. Christou,2011
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献