Sentence examples for using the ls algorithm from inspiring English sources

Figure 4 Example of using the LS algorithm to match humming and MIDI [17, 18].

Equation (27) can be derived by using the LS algorithm: A i X i = B i (27).

The position of MS can also be computed by using the LS algorithm, as shown in Equation (8).

The softmax classifier can be trained by using the L-BFGS algorithm based on a dataset, in order to find an optimal parameter set W (3) for minimizing the cost function ({J_{{text {softmax}}}}left ({mathbf {W}^{(3)}}right)).

This maximization problem can be solved to optimal using the L-BFGS algorithm (Liu and Nocedal, 1989).

We also inferred the ML phylogenetic tree of the 19 strains from 16S rRNA sequences in RAxML, mined from the genome assemblies of the examined taxa, and aligned with MAFFT using the L-INSi algorithm.

We formulate this as a constrained optimization problem: minimizing (or maximizing) the value of a given objective function subject to the constraint that ∑ f = 1 using the L-BFGS algorithm (Byrd et al.., 2006).

The multiple sequence alignment for each group of 1 1 orthologous protein sequences (one single gene copy per species; data set Myc19; supplementary table S1, Supplementary Material online) was built with MAFFT 6.603b using the L-INSi algorithm (–localpair –maxiterate 1000) (Katoh et al. 2005).

For the GGF-TALS algorithm, the computational complexity is dominated by the Tucker decomposition of the original tensor M ∈ C Q × Q × K (realized by the singular-value decomposition (SVD) of the mode-3 matrix M (3)) and the decomposition of the core tensor T ∈ C Q × Q × L using the ALS algorithm.

Sequences were aligned with MAFFT version 7.215 using the L-INS-i algorithm for accurate alignments.

Sequences were aligned using the L-INS-I algorithm implemented in the software MAFFT v. 6 [ 50].