The paper presents a new algorithm, Algorithm M, for constructing suffix trees to aid in exact-match substring searching. This algorithm has the same asymptotic running time as previously published algorithms but is more space-efficient. The author discusses implementation considerations and the update problem, which involves modifying the suffix tree in response to incremental changes in the strings it indexes. Algorithm M is described in detail, including its data structure and the steps for inserting suffixes into the tree. The paper also introduces a hash-coded implementation that further reduces space usage. Additionally, the paper outlines an incremental editing algorithm that updates the suffix tree efficiently when the input string changes. The analysis shows that the update process can be performed in linear time. The conclusion highlights the advantages of Algorithm M over other suffix tree construction algorithms, particularly in terms of space efficiency.The paper presents a new algorithm, Algorithm M, for constructing suffix trees to aid in exact-match substring searching. This algorithm has the same asymptotic running time as previously published algorithms but is more space-efficient. The author discusses implementation considerations and the update problem, which involves modifying the suffix tree in response to incremental changes in the strings it indexes. Algorithm M is described in detail, including its data structure and the steps for inserting suffixes into the tree. The paper also introduces a hash-coded implementation that further reduces space usage. Additionally, the paper outlines an incremental editing algorithm that updates the suffix tree efficiently when the input string changes. The analysis shows that the update process can be performed in linear time. The conclusion highlights the advantages of Algorithm M over other suffix tree construction algorithms, particularly in terms of space efficiency.