Cargando…
Suffix tree searcher: exploration of common substrings in large DNA sequence sets
BACKGROUND: 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 pr...
Autores principales: | Minkley, David, Whitney, Michael J, Lin, Song-Han, Barsky, Marina G, Kelly, Chris, Upton, Chris |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4118789/ https://www.ncbi.nlm.nih.gov/pubmed/25053142 http://dx.doi.org/10.1186/1756-0500-7-466 |
Ejemplares similares
-
A New Algorithm for Fast All-Against-All Substring Matching
por: Barsky, Marina, et al.
Publicado: (2006) -
Relative Suffix Trees
por: Farruggia, Andrea, et al.
Publicado: (2018) -
Sequence Searcher: A Java tool to perform regular expression and fuzzy searches of multiple DNA and protein sequences
por: Marass, Francesco, et al.
Publicado: (2009) -
Phylogeny reconstruction based on the length distribution of k-mismatch common substrings
por: Morgenstern, Burkhard, et al.
Publicado: (2017) -
Simultaneous identification of long similar substrings in large sets of sequences
por: Kleffe, Jürgen, et al.
Publicado: (2007)