Results 11 to 20 of about 2,899,550 (97)
Distinct gene expression patterns within cells are foundational for the diversity of functions and unique characteristics observed in specific contexts, such as human tissues and cell types. Though some biological processes commonly occur across contexts,
Rebeca Queiroz Figueiredo+6 more
doaj +1 more source
One of the central questions in free speech jurisprudence is what activities the First Amendment encompasses. This Article considers that question in the context of an area of increasing importance – algorithm-based decisions.
Bolin, Malin, Nordin, Maria
core +4 more sources
Acknowledgement to Reviewers of Algorithms in 2015
The editors of Algorithms would like to express their sincere gratitude to the following reviewers for assessing manuscripts in 2015. [...]
Algorithms Editorial Office
doaj +1 more source
Acknowledgement to Reviewers of Algorithms in 2014
The editors of Algorithms would like to express their sincere gratitude to the following reviewers for assessing manuscripts in 2014:[...]
Algorithms Editorial Office
doaj +1 more source
The utility of pathway signatures lies in their capability to determine whether a specific pathway or biological process is dysregulated in a given patient.
Sepehr Golriz Khatami+5 more
doaj +1 more source
Acknowledgement to Reviewers of Algorithms in 2013
The editors of Algorithms would like to express their sincere gratitude to the following reviewers for assessing manuscripts in 2013.
Algorithms Editorial Office
doaj +1 more source
On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet [PDF]
We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$.
Nicolas Bédaride+3 more
doaj +1 more source
Acknowledgement to Reviewers of Algorithms in 2018
Rigorous peer-review is the corner-stone of high-quality academic publishing [...]
Algorithms Editorial Office
doaj +1 more source
Constrained ear decompositions in graphs and digraphs [PDF]
Ear decompositions of graphs are a standard concept related to several major problems in graph theory like the Traveling Salesman Problem. For example, the Hamiltonian Cycle Problem, which is notoriously N P-complete, is equivalent to deciding whether a ...
Frédéric Havet, Nicolas Nisse
doaj +1 more source
Cluster algorithms for classical and quantum spin systems are discussed. In particular, the cluster algorithm is applied to classical O(N) lattice actions containing interactions of more than two spins.
A. D. Sokal+26 more
core +2 more sources