Showing results 1 to 4 of 4
| Title | Author(s) | Issue Date | Views | |
|---|---|---|---|---|
An efficient algorithm for online square detection Journal:Theoretical Computer Science | 2006 | 161 | ||
From constrained to unconstrained maximum agreement subtree in linear time Journal:Algorithmica (New York) | 2008 | 168 | ||
An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees Journal:Information Processing Letters | 2006 | 206 | ||
Time and space efficient algorithms for constrained sequence alignment Proceeding/Conference:Lecture Notes in Computer Science | 2005 | 105 |