Results 181 to 190 of about 4,266 (227)
Submodular Generalized Matching for Peptide Identification in Tandem Mass Spectrometry. [PDF]
IEEE/ACM Trans Comput Biol Bioinform, 2019 Bai W, Bilmes J, Noble WS.
europepmc +1 more source
Identifiability of Phylogenetic Level-2 Networks under the Jukes-Cantor Model
Englander AK +6 more
europepmc +1 more source
Not seeing the forest for the trees: size of the minimum spanning trees (MSTs) forest and branch significance in MST-based phylogenetic analysis. [PDF]
PLoS One, 2015 Teixeira AS +4 more
europepmc +1 more source
Optimizing Distributions for Associated Entropic Vectors via Generative Convolutional Neural Networks. [PDF]
Entropy (Basel)Zhang S, Liu N, Kang W, Permuter H.
europepmc +1 more source
Rigidity of Symmetric Frameworks on the Cylinder. [PDF]
Discrete Comput GeomNixon A, Schulze B, Wall J.
europepmc +1 more source
Matroids on convex geometries (cg-matroids)
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Satoru Fujishige, Yoshio Sano
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2003
The main idea in this chapter is to establish the intimate connection between matroids and the symmetric group Sym n . This will be seen most clearly in the Maximality Property, which is really just a reformulation of the well-known characterization of matroids in terms of the Greedy Algorithm.
Alexandre V. Borovik +2 more
openaire +1 more source
The main idea in this chapter is to establish the intimate connection between matroids and the symmetric group Sym n . This will be seen most clearly in the Maximality Property, which is really just a reformulation of the well-known characterization of matroids in terms of the Greedy Algorithm.
Alexandre V. Borovik +2 more
openaire +1 more source