https://en.formulasearchengine.com/index.php?action=history&feed=atom&title=OBD-II_PIDsOBD-II PIDs - Revision history2026-04-17T20:39:35ZRevision history for this page on the wikiMediaWiki 1.43.0-wmf.28https://en.formulasearchengine.com/index.php?title=OBD-II_PIDs&diff=12753&oldid=preven>Xoneca: /* Modes */ Links to mode description sections.2014-01-07T11:15:39Z<p><span class="autocomment">Modes: </span> Links to mode description sections.</p>
<p><b>New page</b></p><div>In [[computer science]], the '''longest repeated substring problem''' is the problem of finding the longest [[substring]] of a [[string (computer science)|string]] that occurs at least twice. This problem can be solved in linear time and space by building a [[suffix tree]] for the string, and finding the deepest internal node in the tree. Depth is measured by the number of characters traversed from the root. The string spelled by the edges from the root to such a node is a longest repeated substring. The problem of finding the longest substring with at least <math>k</math> occurrences can be found by first preprocessing the tree to count the number of leaf descendants for each internal node, and then finding the deepest node with at least <math>k</math> descendants.<br />
<br />
== External links ==<br />
* {{cite web|url=http://www.allisons.org/ll/AlgDS/Tree/Suffix/|title=Suffix Trees|last=Allison|first=L|accessdate=2008-10-14}}<br />
<br />
[[Category:Problems on strings]]<br />
[[Category:Formal languages]]<br />
[[Category:Combinatorics]]<br />
<br />
<br />
{{algorithm-stub}}</div>en>Xoneca