We have developed STAN (suffix-tree analyser), a tool to search for nucleotidic and peptidic patterns within whole chromosomes. Pattern syntax uses a string variable grammar-like formalism which allows the description of complex patterns including ambiguities, insertions/deletions, gaps, repeats and palindromes. STAN is based on a reduction to multipart matching on a suffix-tree data structure and can handle large DNA sequences, whether assembled or not.
Download full-text PDF |
Source |
|---|---|
| http://dx.doi.org/10.1093/bioinformatics/bti710 | DOI Listing |
Publication Analysis
Top Keywords
Similar Publications
Suffix-tree analyser (STAN): looking for nucleotidic and peptidic patterns in chromosomes.
Bioinformatics
December 2005
IRISA-INRIA, Campus de Beaulieu, 35402 Rennes cedex, France.
We have developed STAN (suffix-tree analyser), a tool to search for nucleotidic and peptidic patterns within whole chromosomes. Pattern syntax uses a string variable grammar-like formalism which allows the description of complex patterns including ambiguities, insertions/deletions, gaps, repeats and palindromes. STAN is based on a reduction to multipart matching on a suffix-tree data structure and can handle large DNA sequences, whether assembled or not.
View Article and Find Full Text PDFWant AI Summaries of new PubMed Abstracts delivered to your In-box?
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!