TY - JOUR AU - Minkley, David AU - Whitney, Michael J. AU - Lin, Song-Han AU - Barsky, Marina G. AU - Kelly, Chris AU - Upton, Chris PY - 2014 DA - 2014/07/23 TI - Suffix tree searcher: exploration of common substrings in large DNA sequence sets JO - BMC Research Notes SP - 466 VL - 7 IS - 1 AB - Large DNA sequence data sets require special bioinformatics tools to search and compare them. Such tools should be easy to use so that the data can be easily accessed by a wide array of researchers. In the past, the use of suffix trees for searching DNA sequences has been limited by a practical need to keep the trees in RAM. Newer algorithms solve this problem by using disk-based approaches. However, none of the fastest suffix tree algorithms have been implemented with a graphical user interface, preventing their incorporation into a feasible laboratory workflow. SN - 1756-0500 UR - https://doi.org/10.1186/1756-0500-7-466 DO - 10.1186/1756-0500-7-466 ID - Minkley2014 ER -