Results 91 to 100 of about 1,261,273 (206)

Designing universal primers for the isolation of DNA sequences encoding Proanthocyanidins biosynthetic enzymes in Crataegus aronia

open access: yesBMC Research Notes, 2012
Background Hawthorn is the common name of all plant species in the genus Crataegus, which belongs to the Rosaceae family. Crataegus are considered useful medicinal plants because of their high content of proanthocyanidins (PAs) and other related ...
Zuiter Afnan   +2 more
doaj   +1 more source

Sequence alignment and mutual information [PDF]

open access: yesarXiv, 2008
Background: Alignment of biological sequences such as DNA, RNA or proteins is one of the most widely used tools in computational bioscience. All existing alignment algorithms rely on heuristic scoring schemes based on biological expertise. Therefore, these algorithms do not provide model independent and objective measures for how similar two (or more ...
arxiv  

A Novel Method for Comparative Analysis of DNA Sequences by Ramanujan-Fourier Transform [PDF]

open access: yes, 2014
Alignment-free sequence analysis approaches provide important alternatives over multiple sequence alignment (MSA) in biological sequence analysis because alignment-free approaches have low computation complexity and are not dependent on high level of sequence identity, however, most of the existing alignment-free methods do not employ true full ...
arxiv   +1 more source

A New Simulated Annealing Algorithm for the Multiple Sequence Alignment Problem: The approach of Polymers in a Random Media

open access: yes, 2005
We proposed a probabilistic algorithm to solve the Multiple Sequence Alignment problem. The algorithm is a Simulated Annealing (SA) that exploits the representation of the Multiple Alignment between $D$ sequences as a directed polymer in $D$ dimensions ...
A. Godzik   +10 more
core   +1 more source

Ultra-large alignments using Phylogeny-aware Profiles

open access: yes, 2015
Many biological questions, including the estimation of deep evolutionary histories and the detection of remote homology between protein sequences, rely upon multiple sequence alignments (MSAs) and phylogenetic trees of large datasets.
Kumar, Keerthana   +3 more
core   +1 more source

Automatic detection of anchor points for multiple sequence alignment

open access: yesBMC Bioinformatics, 2010
Background Determining beforehand specific positions to align (anchor points) has proved valuable for the accuracy of automated multiple sequence alignment (MSA) software.
Pitschi Florian   +2 more
doaj   +1 more source

An Overview of Multiple Sequence Alignment Systems [PDF]

open access: yesarXiv, 2009
An overview of current multiple alignment systems to date are described.The useful algorithms, the procedures adopted and their limitations are presented.We also present the quality of the alignments obtained and in which cases(kind of alignments, kind of sequences etc) the particular systems are useful.
arxiv  

IBBOMSA: An Improved Biogeography-based Approach for Multiple Sequence Alignment

open access: yesEvolutionary Bioinformatics, 2016
In bioinformatics, multiple sequence alignment (MSA) is an NP-hard problem. Hence, nature-inspired techniques can better approximate the solution. In the current study, a novel biogeography-based optimization (NBBO) is proposed to solve an MSA problem ...
Rohit Kumar Yadav, Haider Banka
doaj   +2 more sources

ClustalXeed: a GUI-based grid computation version for high performance and terabyte size multiple sequence alignment

open access: yesBMC Bioinformatics, 2010
Background There is an increasing demand to assemble and align large-scale biological sequence data sets. The commonly used multiple sequence alignment programs are still limited in their ability to handle very large amounts of sequences because the ...
Kim Taeho, Joo Hyun
doaj   +1 more source

Approximation algorithms for multiple sequence alignment

open access: yesTheoretical Computer Science, 1994
AbstractWe consider the problem of aligning of k sequences of length n. The cost function is sum of pairs, and satisfies triangle inequality. Earlier results on finding approximation algorithms for this problem are due to Gusfield (1991) who achieved an approximation ratio of 2 − 2k, and Pevzner (1992) who improved it to 2 − 3k.
Pavel A. Pevzner   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy