Then you calculate the subsequences of the leafs (a,b) and (c,d) and in the next step (according some special rules) the subsequences of the subsequences.$a='AAAB'; $b='AABB'; $c='ABBB'; $d='BBBB'; +---$a +----+ | +---$b | + | | +---$c +----+ +---$d
In reply to Re^4: longest common substring
by lima1
in thread longest common substring
by flaviusm
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |