Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference9 articles.
1. G.S. Brodal, K. Kaligosi, I. Katriel, M. Kutz, Faster algorithms for computing longest common increasing subsequences, BRICS RS-05-37, Department of Computer Science, University of Aarhus, Ny Munkegade, building 540, DK-8000 Aarhus C, Denmark, December 14, 2005
2. Enumerating longest increasing subsequences and patience sorting;Bespamyatnikh;Inform. Process. Lett.,2000
3. Efficient algorithms for finding a longest common increasing subsequence;Chan,2005
4. Alignment of whole genomes;Delcher;Nucl. Acids Res.,1999
5. An almost-linear time and linear space algorithm for the longest common subsequence problem;Guo;Inform. Process. Lett.,2005
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献