Cargando…
Simultaneous identification of long similar substrings in large sets of sequences
BACKGROUND: Sequence comparison faces new challenges today, with many complete genomes and large libraries of transcripts known. Gene annotation pipelines match these sequences in order to identify genes and their alternative splice forms. However, the software currently available cannot simultaneou...
Autores principales: | Kleffe, Jürgen, Möller, Friedrich, Wittig, Burghardt |
---|---|
Formato: | Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2007
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1892095/ https://www.ncbi.nlm.nih.gov/pubmed/17570866 http://dx.doi.org/10.1186/1471-2105-8-S5-S7 |
Ejemplares similares
-
Suffix tree searcher: exploration of common substrings in large DNA sequence sets
por: Minkley, David, et al.
Publicado: (2014) -
Genome comparison without alignment using shortest unique substrings
por: Haubold, Bernhard, et al.
Publicado: (2005) -
Fast algorithms for computing sequence distances by exhaustive substring composition
por: Apostolico, Alberto, et al.
Publicado: (2008) -
Efficient privacy-preserving variable-length substring match for genome sequence
por: Nakagawa, Yoshiki, et al.
Publicado: (2022) -
Mining Unique-m Substrings from Genomes
por: Ye, Kai, et al.
Publicado: (2010)