Pattern recognition in several sequences: Consensus and alignment
This paper gives a practical algorithm to determine the consensus alignment of several sequences. In biology, this problem is central to determination of secondary and tertiary structures and functional significance of subsequences in DNA or proteins. The computation required for the algorithm is (loosely speaking) O(rn), where r is the number of sequences and n is the length of the sequences, rather than the usual \(O(n^ r)\) of dynamic programming algorithms. The algorithm can find unknown consensus sequences and search for homologues of a known functional sequence. A discussion of statistical significance of the results is also included. In particular, the algorithm is applicable to the search for mutational hotspots, and promoter and regulatory regions in DNA, as well as binding sites for repressor proteins and hormones.
- Estimation of probability densities by empirical density functions†
- General methods of sequence comparison
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3626442 (Why is no real title available?)
- scientific article; zbMATH DE number 3314813 (Why is no real title available?)
- On Estimation of a Probability Density Function and Mode
- Renewal theory for several patterns
- Pattern recognition in genetic sequences by mismatch density
- A nonlinear measure of subalignment similarity and its significance levels
- Tutorial on large deviations for the binomial distribution
- Consensus weak hierarchies
- A survey of multiple sequence comparison methods
- Consensus sequences based on plurality rule
- A multiple sequence comparison method
- Interpreting consensus sequences based on plurality rule
- Efficient optimal decomposition of a sequence into disjoint regions, each matched to some template in an inventory
- An efficient method for searching characteristic patterns of a subset in a large set of character sequences
- Consensus rules for committee elections
- The computation of consensus patterns in \(DNA\) sequences
- On the consistency of the plurality rule consensus function for molecular sequences
- Matching among multiple random sequences
- Multiple sequence comparison -- a peptide matching approach
- On the complexity of finding common approximate substrings.
- Consensus decoding of recurrent neural network basecallers
- Finding similar regions in many sequences
- Multiple sequence comparison and consistency on multipartite graphs
- The asymptotic plurality rule for molecular sequences
- Consensus functions and patterns in molecular sequences
- Pattern-constrained multiple polypeptide sequence alignment
- scientific article; zbMATH DE number 1717343 (Why is no real title available?)
- Sequence similarity, motif detection and alignments with N-local decoded anchor points.
- scientific article; zbMATH DE number 5189976 (Why is no real title available?)
- A protein coding gene alignment algorithm based on SPA
- A Dynamic Programming Approach to Sequential Pattern Recognition
- Efficient algorithms for molecular sequence analysis.
- A consistency technique for pattern association
- scientific article; zbMATH DE number 1944143 (Why is no real title available?)
- scientific article; zbMATH DE number 1945168 (Why is no real title available?)
- scientific article; zbMATH DE number 1974597 (Why is no real title available?)
- scientific article; zbMATH DE number 2040771 (Why is no real title available?)
- Probabilistic clustering of sequences: Inferring new bacterial regulons by comparative genomics
- Finding the consensus shape for a protein family
- scientific article; zbMATH DE number 4116362 (Why is no real title available?)
- scientific article; zbMATH DE number 4116363 (Why is no real title available?)
- A parallel algorithm for pattern discovery in biological sequences
- scientific article; zbMATH DE number 826057 (Why is no real title available?)
- scientific article; zbMATH DE number 1444327 (Why is no real title available?)
- An Eulerian path approach to local multiple alignment for DNA sequences
- Efficient relaxed search in hierarchically clustered sequence datasets
- Fast multiple alignment of ungapped DNA sequences using information theory and a relaxation method
- Discovering unbounded unions of regular pattern languages from positive examples
- General methods of sequence comparison
- Topological maps of protein sequences
- On the longest common rigid subsequence problem
- Detection of subtle variations as consensus motifs
- Recognising online spatial activities using a bioinformatics inspired sequence alignment approach
This page was built for publication: Pattern recognition in several sequences: Consensus and alignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1059004)
