Author:
Ohlebusch Enno,Beller Timo
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference31 articles.
1. Replacing suffix trees with enhanced suffix arrays;Abouelhoda;J. Discrete Algorithms,2004
2. Efficient computation of all perfect repeats in genomic sequences of up to half a gigabyte, with a case study on the human genome;Becher;Bioinformatics,2009
3. Space-efficient computation of maximal and supermaximal repeats in genome sequences;Beller,2012
4. Computing the longest common prefix array based on the Burrows–Wheeler transform;Beller,2011
5. Trace clustering based on conserved patterns: towards achieving better process models;Bose,2009
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献