scholarly journals Algorithms for the search of amino acid patterns in nucleic acid sequences

1986 ◽  
Vol 14 (1) ◽  
pp. 99-107 ◽  
Author(s):  
Hannu Peltola ◽  
Hans Söderlund ◽  
Esko Ukkonen
2017 ◽  
Author(s):  
Koen Deforche

AbstractMotivationBiological sequence alignment is fundamental to their further interpretation. Current alignment algorithms typically align either nucleic acid or amino acid sequences. Using only nucleic acid sequence similarity, divergent sequences cannot be aligned reliably because of the limited alphabet and genetic saturation. To align divergent coding nucleic acid sequences, one can align using the translated amino acid sequences. This requires the detection of the correct open reading frame, is prone to eventual frame shift errors, and typically requires the treatment of genes separately. It was our motivation to design a nucleic acid sequence alignment algorithm to align a nucleic acid sequence against a (reference) genome sequence, that works equally well for similar and divergent sequences, and produces an optimal alignment considering simultaneously the alignment of all annotated coding sequences.ResultsWe define a genome alignment score for evaluating the quality of an alignment of a nucleic acid query sequence against a reference genome sequence, for which coding sequence features have been annotated (for example in a GenBank record). The genome alignment score combines the a ne gap score for the nucleic acid sequence with an a ne gap score for all amino acid alignments resulting from coding sequences in open reading frames contained within the query sequence. We present a Dynamic Programming algorithm to compute the optimal global or local alignment using this genomic alignment score and provide a formal proof of correctness. This algorithm allows the alignment of nucleic acid sequences from closely related and highly divergent sequences within the same software and using the same parameters, automatically correcting any eventual frame shift errors and produces at the same time the aligned translated amino acid sequences of all relevant coding sequence features.AvailabilityThe software is available as a web application at http://www.genomedetective.com/app/aga and as command-line application at https://github.com/emweb/aga


2019 ◽  
Author(s):  
Veeren Chauhan ◽  
Mohamed M Elsutohy ◽  
C Patrick McClure ◽  
Will Irving ◽  
Neil Roddis ◽  
...  

<p>Enteroviruses are a ubiquitous mammalian pathogen that can produce mild to life-threatening disease. Bearing this in mind, we have developed a rapid, accurate and economical point-of-care biosensor that can detect a nucleic acid sequences conserved amongst 96% of all known enteroviruses. The biosensor harnesses the physicochemical properties of gold nanoparticles and aptamers to provide colourimetric, spectroscopic and lateral flow-based identification of an exclusive enteroviral RNA sequence (23 bases), which was identified through in silico screening. Aptamers were designed to demonstrate specific complementarity towards the target enteroviral RNA to produce aggregated gold-aptamer nanoconstructs. Conserved target enteroviral nucleic acid sequence (≥ 1x10<sup>-7</sup> M, ≥1.4×10<sup>-14</sup> g/mL), initiates gold-aptamer-nanoconstructs disaggregation and a signal transduction mechanism, producing a colourimetric and spectroscopic blueshift (544 nm (purple) > 524 nm (red)). Furthermore, lateral-flow-assays that utilise gold-aptamer-nanoconstructs were unaffected by contaminating human genomic DNA, demonstrated rapid detection of conserved target enteroviral nucleic acid sequence (< 60 s) and could be interpreted with a bespoke software and hardware electronic interface. We anticipate our methodology will translate in-silico screening of nucleic acid databases to a tangible enteroviral desktop detector, which could be readily translated to related organisms. This will pave-the-way forward in the clinical evaluation of disease and complement existing strategies at overcoming antimicrobial resistance.</p>


Author(s):  
Pavel Beran ◽  
Dagmar Stehlíková ◽  
Stephen P Cohen ◽  
Vladislav Čurn

Abstract Summary Searching for amino acid or nucleic acid sequences unique to one organism may be challenging depending on size of the available datasets. K-mer elimination by cross-reference (KEC) allows users to quickly and easily find unique sequences by providing target and non-target sequences. Due to its speed, it can be used for datasets of genomic size and can be run on desktop or laptop computers with modest specifications. Availability and implementation KEC is freely available for non-commercial purposes. Source code and executable binary files compiled for Linux, Mac and Windows can be downloaded from https://github.com/berybox/KEC. Supplementary information Supplementary data are available at Bioinformatics online.


Sign in / Sign up

Export Citation Format

Share Document