We describe the use of Java Pattern Finder (JaPaFi) to identify short (<100 nt) highly conserved sequences in a series of poxvirus genomes. The algorithm utilizes pattern matching to identify approximate matches appearing at least once in each member of a set of genomes; a key feature is that the genomes do not need to be aligned. The user simply specifies the genomes to search, minimum length of sequences to find and the maximum number of mismatches and indels allowed. Many of the most highly conserved segments contain poxvirus promoter elements.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3185747 | PMC |
http://dx.doi.org/10.3390/v2091867 | DOI Listing |
Viruses
September 2010
Department of Biochemistry and Microbiology, University of Victoria, Victoria, BC, V8W 3P6, Canada.
We describe the use of Java Pattern Finder (JaPaFi) to identify short (<100 nt) highly conserved sequences in a series of poxvirus genomes. The algorithm utilizes pattern matching to identify approximate matches appearing at least once in each member of a set of genomes; a key feature is that the genomes do not need to be aligned. The user simply specifies the genomes to search, minimum length of sequences to find and the maximum number of mismatches and indels allowed.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!