Results 51 to 60 of about 483,132 (293)
Sequence alignment, mutual information, and dissimilarity measures for constructing phylogenies
, 2011 Background: Existing sequence alignment algorithms use heuristic scoring schemes based on biological expertise, which cannot be used as objective distance metrics.
Penner, Orion +8 more
core +1 more source
TaxMan: a taxonomic database manager [PDF]
, 2006 Background Phylogenetic analysis of large, multiple-gene datasets, assembled from public sequence databases, is rapidly becoming a popular way to approach difficult phylogenetic problems.
Blaxter Mark +5 more
core +1 more source
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
Parallel progressive multiple sequence alignment on reconfigurable meshes
BMC Genomics, 2011 Background One of the most fundamental and challenging tasks in bio-informatics is to identify related sequences and their hidden biological significance.
Nguyen Ken D, Pan Yi, Nong Ge
doaj +1 more source
Multiple sequence alignment for short sequences
CoRR, 2015 Multiple sequence alignment (MSA) has been one of the most important problems in bioinformatics for more decades and it is still heavily examined by many mathematicians and biologists. However, mostly because of the practical motivation of this problem, the research on this topic is focused on aligning long sequences.
openaire +2 more sources
A multiple sequence alignment program
Nucleic Acids Research, 1986 A program is described for simultaneously aligning two or more molecular sequences which is based on first finding common segments above a specified length and then piecing these together to maximize an alignment scoring function. Optimal as well as near-optimal alignments are found, and there is also provided a means for randomizing the given ...
Eric M. Sobel, H. M. Martinez
openaire +3 more sources
Calpain small subunit homodimerization is robust and calcium‐independent
FEBS Letters, EarlyView.Calpains dimerize via penta‐EF‐hand (PEF) domains. Using single‐molecule force spectroscopy, we measured the strength and kinetics of PEF–PEF homodimer binding. The interaction is robust, shows a transient conformational step before dissociation, and remains largely insensitive to Ca2+.
Nesha May O. Andoy +4 more
wiley +1 more source
HAlign-G: rapid and low-memory multiple-genome aligner for large-scale closely related genomes
Genome BiologyHAlign-G is a fast and memory-efficient tool for large-scale multiple genome alignment. Using BWT-FM-LIS with an optimized K-band algorithm and star alignment strategy, it supports intra-species (HAlign-G1) and cross-species (HAlign-G2) alignment ...
Pinglu Zhang +8 more
doaj +1 more source
Heuristic for Solving the Multiple Alignment Sequence Problem
Revista de Matemática: Teoría y Aplicaciones, 2011 In this paper we developed a new algorithm for solving the problem of multiple sequence alignment (AM S), which is a hybrid metaheuristic based on harmony search and simulated annealing.
Roman Anselmo Mora Gutiérrez +2 more
doaj +1 more source
BMC Bioinformatics, 2020 Background Given a binary tree T $\mathcal {T}$ of n leaves, each leaf labeled by a string of length at most k, and a binary string alignment function ⊗, an implied alignment can be generated to describe the alignment of a dynamic homology for T ...
Alex J. Washburn, Ward C. Wheeler
doaj +1 more source