Results 21 to 30 of about 4,146,099 (286)
Information Theory in Computational Biology: Where We Stand Today
Entropy, 2020 “A Mathematical Theory of Communication” was published in 1948 by Claude Shannon to address the problems in the field of data compression and communication over (noisy) communication channels.
Pritam Chanda +5 more
doaj +1 more source
Fast Quantum Search Algorithms in Protein Sequence Comparison - Quantum Biocomputing [PDF]
, 2000 Quantum search algorithms are considered in the context of protein sequence comparison in biocomputing. Given a sample protein sequence of length m (i.e m residues), the problem considered is to find an optimal match in a large database containing N ...
B.E. Kane +15 more
core +2 more sources
Genomic of the severe isolate of Maize chlorotic dwarf virus
Plant Protection Science, 2004 The complete sequences of the severe isolates of Maize chlorotic dwarf virus (MCDV-S) were obtained from cDNA clones of the viral RNA. The genome is 11 785 nucleotides (nt) in length and contains one large open reading frame between nt 455 and 10 825 ...
Rym Chaouch +3 more
doaj +1 more source
fMRI Investigation of Cortical and Subcortical Networks in the Learning of Abstract and Effector-Specific Representations of Motor Sequences [PDF]
, 2006 A visuomotor sequence can be learned as a series of visuo-spatial cues or as a sequence of effector movements. Earlier imaging studies have revealed that a network of brain areas is activated in the course of motor sequence learning.
Bapi, Dr. Raju S. +3 more
core +1 more source
Comparison of DNA Sequences with Protein Sequences
Genomics, 1997 The FASTA package of sequence comparison programs has been expanded to include FASTX and FASTY, which compare a DNA sequence to a protein sequence database, translating the DNA sequence in three frames and aligning the translated DNA sequence to each sequence in the protein database, allowing gaps and frameshifts.
W R, Pearson +3 more
openaire +2 more sources
A new approach to sequence comparison: normalized sequence alignment [PDF]
Bioinformatics, 2001 Abstract The Smith–Waterman algorithm for local sequence alignment is one of the most important techniques in computational molecular biology. This ingenious dynamic programming approach was designed to reveal the highly conserved fragments by discarding poorly conserved initial and terminal segments.
Abdullah N. Arslan +2 more
openaire +2 more sources
Journal of Infection in Developing Countries, 2011 Introduction: Influenza A viruses possess a unique genomic structure which leads to genetic instability, especially in products of neuraminidase and hemagglutinin genes.
Azeem Mehmood Butt +7 more
doaj +1 more source
BMC Microbiology, 2021 Background Acquisition of IncI1 plasmids by members of the Enterobacteriaceae sometimes leads to transfer of antimicrobial resistance and colicinogeny as well as change of phage type in Salmonella Typhimurium. Isolates of S.
Lester Hiley +2 more
doaj +1 more source
Strong and A-statistical comparisons for sequences
Journal of Mathematical Analysis and Applications, 2003 Let \(B=(b_{nk})\) be a non-negative regular matrix and \(K \subseteq N=\{1,2, \dots\}\). If there exists \[ \delta_B(K)= \lim_{n\to \infty} \sum^\infty_{k=1} b_{nk}\chi(k) \] \(\chi\) being the characteristic function of \(K\), then \(\delta_B(K)\) is said to be the \(B\)-density of \(K\).
Demirci, Kamil +2 more
openaire +3 more sources
Bounds for parametric sequence comparison
6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268), 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Fernández-Baca +2 more
openaire +2 more sources