Sciweavers

391 search results - page 39 / 79
» Aligning Two Fragmented Sequences
Sort
View
BMCBI
2008
103views more  BMCBI 2008»
13 years 10 months ago
The VirusBanker database uses a Java program to allow flexible searching through Bunyaviridae sequences
Background: Viruses of the Bunyaviridae have segmented negative-stranded RNA genomes and several of them cause significant disease. Many partial sequences have been obtained from ...
Mathieu Fourment, Mark J. Gibbs
CIARP
2006
Springer
14 years 1 months ago
Alignment of Paragraphs in Bilingual Texts Using Bilingual Dictionaries and Dynamic Programming
Parallel text alignment is a special type of pattern recognition task aimed to discover the similarity between two sequences of symbols. Given the same text in two different langua...
Alexander F. Gelbukh, Grigori Sidorov
JIB
2007
95views more  JIB 2007»
13 years 9 months ago
Mining for Single Nucleotide Polymorphisms in Expressed Sequence Tags
As a multitude of sequence data are published, discovering polymorphisms bioinformatically becomes a valid option. In silico Single Nucleotide Polymorphism (SNP) detection is base...
E. L. Souche, B. Hellemans, J. K. J. Van Houdt, A....
BMCBI
2002
101views more  BMCBI 2002»
13 years 9 months ago
Total sequence decomposition distinguishes functional modules, "molegos" in apurinic/apyrimidinic endonucleases
Background: Total sequence decomposition, using the web-based MASIA tool, identifies areas of conservation in aligned protein sequences. By structurally annotating these motifs, t...
Catherine H. Schein, Numan Özgün, Tadahi...
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 4 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng