Keywords
TRACE (psycholinguistics)Sequence (biology)Pairwise comparisonMathematicsSet (abstract data type)CombinatoricsProperty (philosophy)Multiple sequence alignmentUpper and lower boundsCharacter (mathematics)AlgorithmComputer scienceSequence alignmentStatisticsGeometry
Affiliated Institutions
Related Publications
The Multiple Sequence Alignment Problem in Biology
The study and comparison of sequences of characters from a finite alphabet is relevant to various areas of science, notably molecular biology. The measurement of sequence simila...
Enredo and Pecan: Genome-wide mammalian consistency-based multiple alignment with paralogs
Pairwise whole-genome alignment involves the creation of a homology map, capable of performing a near complete transformation of one genome into another. For multiple genomes th...
On the Complexity of Multiple Sequence Alignment
We study the computational complexity of two popular problems in multiple sequence alignment: multiple alignment with SP-score and multiple tree alignment. It is shown that the ...
Efficient large-scale sequence comparison by locality-sensitive hashing
Abstract Motivation: Comparison of multimegabase genomic DNA sequences is a popular technique for finding and annotating conserved genome features. Performing such comparisons e...
Profile hidden Markov models.
Abstract The recent literature on profile hidden Markov model (profile HMM) methods and software is reviewed. Profile HMMs turn a multiple sequence alignment into a position-spe...
Publication Info
- Year
- 2005
- Type
- book-chapter
- Pages
- 106-119
- Citations
- 113
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
113
OpenAlex
Cite This
John Kececioglu
(2005).
The maximum weight trace problem in multiple sequence alignment.
Lecture notes in computer science
, 106-119.
https://doi.org/10.1007/bfb0029800
Identifiers
- DOI
- 10.1007/bfb0029800