| W02-2106 | our algorithm ? If we choose a | dynamic programming implementation | of the abstract algorithm , then |
| D09-1039 | common substructures and derive a | dynamic programming implementation | of the recursion . We compare |
| N09-1014 | noncontiguous substrings . We use a | dynamic programming implementation | of string kernels ( Rousu and |
| W15-3806 | maximal possible matching , using a | dynamic programming implementation | that has a quadratic complexity |
| W11-2159 | characters . We used the standard | dynamic programming implementation | of our edit distance , but extended |
| W06-2608 | Cancedda et al. , 2003 ) based on a | dynamic programming implementation | . It is reported in the following |
| W03-0315 | comparable document pair . In our | dynamic programming implementation | , we allow for seven alignment |
| J01-3007 | formalism that does not impede | dynamic programming implementations | of the usual inside , outside |
| P09-1086 | i.e. , the output of a typical | dynamic programming implementation | of the edit distance algorithm |
| J09-4007 | recursive formulation based on a | dynamic programming implementation | ( Lodhi et al. 2002 ; Saunders |
