2007
Ce document est lié à :
info:eu-repo/semantics/altIdentifier/doi/10.1371/journal.pone.0000579
Ce document est lié à :
info:eu-repo/semantics/altIdentifier/pmid/17593978
Ce document est lié à :
info:eu-repo/semantics/altIdentifier/pissn/1932-6203
Ce document est lié à :
info:eu-repo/semantics/altIdentifier/urn/urn:nbn:ch:serval-BIB_DD138EBA55CC2
info:eu-repo/semantics/openAccess , Copying allowed only for non-profit organizations , https://serval.unil.ch/disclaimer
C. Iseli et al., « Indexing strategies for rapid searches of short words in genome sequences. », Serveur académique Lausannois, ID : 10.1371/journal.pone.0000579
Searching for matches between large collections of short (14-30 nucleotides) words and sequence databases comprising full genomes or transcriptomes is a common task in biological sequence analysis. We investigated the performance of simple indexing strategies for handling such tasks and developed two programs, fetchGWI and tagger, that index either the database or the query set. Either strategy outperforms megablast for searches with more than 10,000 probes. FetchGWI is shown to be a versatile tool for rapidly searching multiple genomes, whose performance is limited in most cases by the speed of access to the filesystem. We have made publicly available a Web interface for searching the human, mouse, and several other genomes and transcriptomes with oligonucleotide queries.