Results 21 to 30 of about 1,667,563 (261)
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
Repeated Web Page Visits and the Scanpath Theory: A Recurrent Pattern Detection Approach
Journal of Eye Movement Research, 2010 This paper investigates the eye movement sequences of users visiting web pages repeatedly. We are interested in potential habituation due to repeated exposure.
Michael Burmester, Marcus Mast
doaj +1 more source
BMC Bioinformatics, 2020 Background Alignment-free methods for sequence comparisons have become popular in many bioinformatics applications, specifically in the estimation of sequence similarity measures to construct phylogenetic trees.
Sriram P. Chockalingam +4 more
doaj +1 more source
Gap Filling Method Based on Long Reads and Multiple Sequences Alignment [PDF]
Jisuanji gongcheng, 2021 Gap filling methods are helpful for obtaining more complete and accurate genome sequence,and thus assist in many studies on gene expression and regulation,structural variation analysis,and species evolution.Still,the accuracy and completeness of gap ...
WU Dong, WEI Yawei, LUO Junwei, AO Shan
doaj +1 more source
Circular sequence comparison: algorithms and applications. [PDF]
Algorithms Mol Biol, 2016 Sequence comparison is a fundamental step in many important tasks in bioinformatics; from phylogenetic reconstruction to the reconstruction of genomes. Traditional algorithms for measuring approximation in sequence comparison are based on the notions of distance or similarity, and are generally computed through sequence alignment techniques.
Grossi R +6 more
europepmc +6 more sources
Secure and private sequence comparisons [PDF]
Proceedings of the 2003 ACM workshop on Privacy in the electronic society, 2003 We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other than what can be inferred from the edit distance between their two sequences - which is unavoidable because computing that distance is the purpose of the protocol).
Mikhail J. Atallah +2 more
openaire +1 more source