Faster Algorithms for Sampling and Counting Biological Sequences

Author(s):  
Christina Boucher
Keyword(s):  
2018 ◽  
Vol 25 (9) ◽  
pp. 822-829 ◽  
Author(s):  
Wei Zhao ◽  
Likun Wang ◽  
Tian-Xiang Zhang ◽  
Ze-Ning Zhao ◽  
Pu-Feng Du

2009 ◽  
Vol 43 (1) ◽  
pp. 203-205 ◽  
Author(s):  
Chetan Kumar ◽  
K. Sekar

The identification of sequence (amino acids or nucleotides) motifs in a particular order in biological sequences has proved to be of interest. This paper describes a computing server,SSMBS, which can locate and display the occurrences of user-defined biologically important sequence motifs (a maximum of five) present in a specific order in protein and nucleotide sequences. While the server can efficiently locate motifs specified using regular expressions, it can also find occurrences of long and complex motifs. The computation is carried out by an algorithm developed using the concepts of quantifiers in regular expressions. The web server is available to users around the clock at http://dicsoft1.physics.iisc.ernet.in/ssmbs/.


BMC Genomics ◽  
2011 ◽  
Vol 12 (Suppl 4) ◽  
pp. S11 ◽  
Author(s):  
Anderson R Santos ◽  
Marcos A Santos ◽  
Jan Baumbach ◽  
John A McCulloch ◽  
Guilherme C Oliveira ◽  
...  

Author(s):  
Guillermo Restrepo

: The deluge of biological sequences ranging from those of proteins, DNA and RNA to genomes has increased the models for their representation, which are further used to contrast those sequences. Here we present a brief bibliometric description of the research area devoted to representation of biological sequences and highlight the semiotic reaches of this process. Finally, we argue that this research area needs further research according to the evolution of mathematical chemistry and its drawbacks are required to be overcome.


Author(s):  
Alberto Moraglio ◽  
Riccardo Poli ◽  
Rolv Seehuus

Sign in / Sign up

Export Citation Format

Share Document