<?xml version="1.0" encoding="windows-1252"?>
<node id="140577" title="Re: Matching bits of 2 strings" created="2002-01-22 02:04:29" updated="2005-07-21 01:30:39">
<type id="11">
note</type>
<author id="82147">
Zaxo</author>
<data>
<field name="doctext">
&lt;p&gt;If you sort a list of the strings into an array, the deepest matches will be neighbors. That allows you to terminate the search after relatively few applications of [japhy]'s excellent advice.&lt;/p&gt;
&lt;p&gt;After Compline,&lt;br/&gt;Zaxo&lt;/p&gt;
</field>
<field name="root_node">
140538</field>
<field name="parent_node">
140538</field>
</data>
</node>
