Results 1 to 10 of about 1,015,687 (277)
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
Multiple sequence alignment accuracy and evolutionary distance estimation
BMC Bioinformatics, 2005 Background Sequence alignment is a common tool in bioinformatics and comparative genomics. It is generally assumed that multiple sequence alignment yields better results than pair wise sequence alignment, but this assumption has rarely been tested, and ...
Rosenberg Michael S
doaj +1 more source
Cognitively Economical Heuristic for Multiple Sequence Alignment under Uncertainties
Axioms, 2022 This paper introduces a heuristic for multiple sequence alignment aimed at improving real-time object recognition in short video streams with uncertainties.
Milan Gnjatović +5 more
doaj +1 more source
Multiple alignment by sequence annealing [PDF]
Bioinformatics, 2007 AbstractMotivation: We introduce a novel approach to multiple alignment that is based on an algorithm for rapidly checking whether single matches are consistent with a partial multiple alignment. This leads to a sequence annealing algorithm, which is an incremental method for building multiple sequence alignments one match at a time.
Schwartz, Ariel S., Pachter, Lior
openaire +3 more sources
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
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
Multiple sequence alignments in linguistics [PDF]
Proceedings of the EACL 2009 Workshop on Language Technology and Resources for Cultural Heritage, Social Sciences, Humanities, and Education - LaTeCH-SHELT&R '09, 2009 In this study we apply and evaluate an iterative pairwise alignment program for producing multiple sequence alignments, ALPHAMALIG (Alonso et al., 2004), using as material the phonetic transcriptions of words used in Bulgarian dialectological research. To evaluate the quality of the multiple alignment, we propose two new methods based on comparing each
Prokić, J., Wieling, M., Nerbonne, J.
openaire +2 more sources
Segment-based multiple sequence alignment [PDF]
Bioinformatics, 2008 Abstract Motivation: Many multiple sequence alignment tools have been developed in the past, progressing either in speed or alignment accuracy. Given the importance and wide-spread use of alignment tools, progress in both categories is a contribution to the community and has driven research in the field so far. Results: We
Rausch, T. +5 more
openaire +3 more sources
Sigma: multiple alignment of weakly-conserved non-coding DNA sequence
BMC Bioinformatics, 2006 Background Existing tools for multiple-sequence alignment focus on aligning protein sequence or protein-coding DNA sequence, and are often based on extensions to Needleman-Wunsch-like pairwise alignment methods. We introduce a new tool, Sigma, with a new
Siddharthan Rahul
doaj +1 more source
BMC BioinformaticsBackground Most multiple sequence alignment and string-graph alignment algorithms focus on global alignment, but many applications exist for semi-global and local string-graph alignment.
Minindu Weerakoon +2 more
doaj +1 more source