To illustrate this, we assessed the performance of a simple alignment method that matches pairs within an ambiguous cluster by maximizing the total sequence similarity over matched pairs.
PANDAseq merges fragments by maximizing the probability of true sequence matches, given the observed sequences.
By maximizing the joint likelihood of sequence and expression, TRANSMODIS identifies a set of genes that have consistent and highly elevated expressions and high scoring putative binding sites.
Here we propose an algorithm that reorganizes an agent's representation of sensory space by maximizing the predictability of sensory state transitions given a motor action.
In the synthesis phase, given the input text, the corresponding state sequence is decided by maximizing the overall duration probability.
The algorithm aligns ZF repeat unit sequences by maximizing the alignment score, as is typical for nucleotide and protein sequence alignment.
We train a CRF by maximizing the log-likelihood of a label sequence in the training data.
These parameters are obtained by maximizing the pseudo-likelihood of the observed sequence pairs, rather than their likelihood, which makes the quite formidable estimation tractable.
With the state sequence, the static spectral and excitation features are determined by maximizing the joint data-likelihood of the combined static and dynamic feature streams.
In Karlin-Altschul statistics of sequence similarity, two sequences are optimally aligned by maximizing the similarity between them [ 41- 43].
