All Stories

  1. The frequent complete subgraphs in the human connectome
  2. The Frequent Network Neighborhood Mapping of the human hippocampus shows much more frequent neighbor sets in males than in females
  3. The frequent subgraphs of the connectome of the human brain
  4. High-resolution directed human connectomes and the Consensus Connectome Dynamics
  5. Comparing advanced graph-theoretical parameters of the connectomes of the lobes of the human brain
  6. Mapping correlations of psychological and structural connectome properties of the dataset of the human connectome project with the maximum spanning tree method
  7. MetaHMM: A webserver for identifying novel genes with specified functions in metagenomic samples
  8. Near perfect protein multi-label classification with deep neural networks
  9. The Robustness and the Doubly-Preferential Attachment Simulation of the Consensus Connectome Dynamics of the Human Brain
  10. The braingraph.org database of high resolution structural connectomes and the brain graph tools
  11. Brain size bias compensated graph-theoretical parameters are also better in women’s structural connectomes
  12. The “Giant Virus Finder” discovers an abundance of giant viruses in the Antarctic dry valleys
  13. Life without dUTPase
  14. Parameterizable consensus connectomes from the Human Connectome Project: the Budapest Reference Connectome Server v3.0
  15. Fast and exact sequence alignment with the Smith–Waterman algorithm: The SwissAlign webserver
  16. How to Direct the Edges of the Connectomes: Dynamics of the Consensus Connectomes and the Development of the Connections in the Human Brain
  17. Significant differences found in short nucleotide sequences of human intestinal metagenomes of Northern-European and Chinese Origin
  18. Nucleotide 9-mers characterize the type II diabetic gut metagenome
  19. Evaluating the Quantitative Capabilities of Metagenomic Analysis Software
  20. Giant viruses of the Kutch Desert
  21. Graph Theoretical Analysis Reveals: Women’s Brains Are Better Connected than Men’s
  22. A note on the PageRank of undirected graphs
  23. Antimycobacterial activity of peptide conjugate of pyridopyrimidine derivative against Mycobacterium tuberculosis in a series of in vitro and in vivo models
  24. The Budapest Reference Connectome Server v2.0
  25. Identifying diabetes-related important protein targets with few interacting partners with the PageRank algorithm
  26. On dimension reduction of clustering results in structural bioinformatics
  27. Visual Analysis of the Quantitative Composition of Metagenomic Communities: the AmphoraVizu Webserver
  28. The Metagenomic Telescope
  29. The Erdős webgraph server
  30. An intuitive graphical webserver for multiple-choice protein sequence search
  31. AmphoraNet: The webserver implementation of the AMPHORA2 metagenomic workflow suite
  32. Catalytic mechanism of  -phosphate attack in dUTPase is revealed by X-ray crystallographic snapshots of distinct intermediates, 31P-NMR spectroscopy and reaction path modelling
  33. Characterizing the Functional Similarity of Enzymes with High Co-Citation in Interaction Networks
  34. Equal Opportunity for Low-Degree Network Nodes: A PageRank-Based Method for Protein Target Identification in Metabolic Graphs
  35. Enhanced Cellular Uptake of a New, in Silico Identified Antitubercular Candidate by Peptide Conjugation
  36. How to Find Non Hub Important Nodes in Protein Networks?
  37. Mathematical modelling and computer simulation of Brownian motion and hybridisation of nanoparticle–bioprobe–polymer complexes in the low concentration limit
  38. Discovery of Novel MDR-Mycobacterium tuberculosis Inhibitor by New FRIGATE Computational Screen
  39. 3-D Brownian Motion Simulator for High-Sensitivity Nanobiotechnological Applications
  40. When the Web meets the cell: using personalized PageRank for analyzing protein interaction networks
  41. A hybrid clustering of protein binding sites
  42. Cysteine and tryptophan anomalies found when scanning all the binding sites in the Protein Data Bank
  43. ON THE ASYMMETRY OF THE RESIDUE COMPOSITIONS OF THE BINDING SITES ON PROTEIN SURFACES
  44. DECOMP: A PDB decomposition tool on the web
  45. Four spatial points that define enzyme families
  46. NASCENT: An automatic protein interaction network generation tool for non-model organisms
  47. On the Bond Graphs in the Delaunay-Tetrahedra of the Simplicial Decomposition of Spatial Protein Structures
  48. Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
  49. Analyzing the simplicial decomposition of spatial protein structures
  50. Being a binding site: Characterizing residue composition of binding sites on proteins
  51. THE RAMACHANDRAN MAP OF MORE THAN 6,500 PERFECT POLYPEPTIDE CHAINS
  52. High throughput processing of the structural information in the protein data bank
  53. Pairs of codes with prescribed Hamming distances and coincidences
  54. Building a Structured PDB: The RS-PDB Database
  55. Building a Structured PDB: The RS-PDB Database
  56. Co-Orthogonal Codes
  57. On some applications of randomized memory
  58. Generalized Secure Routerless Routing
  59. Secure routerless routing
  60. A Note on Explicit Ramsey Graphs and Modular Sieves
  61. A Note on Non-Deterministic Communication Complexity with Few Witnesses
  62. Computing Elementary Symmetric Polynomials with a Subpolynomial Numberof Multiplications
  63. Constructing set systems with prescribed intersection sizes
  64. On k-wise set-intersections and k-wise Hamming-distances
  65. Co-orthogonal Codes
  66. Constructive Upper Bounds for Intersecting Set Systems
  67. Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs
  68. Lower Bounds for (MOD p - MOD m ) Circuits
  69. Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions
  70. A lower bound for depth-3 circuits with MOD m gates
  71. Circuits and multi-party protocols
  72. A degree-decreasing Lemma for (MOD q, MOD p) circuits
  73. On the power of circuits with gates of low L1 norms
  74. On set systems with restricted intersections modulo a composite number
  75. Harmonic analysis, real approximation, and the communication complexity of Boolean functions
  76. Separating the Communication Complexities of MOD m and MOD p Circuits
  77. The Bns Lower-Bound for Multiparty Protocols Is Nearly Optimal
  78. A weight-size trade-off for circuits with MOD m gates
  79. On a ramsey-theoretic property of orders
  80. Separating the communication complexities of MOD m and MOD p circuits
  81. Large parallel machines can be extremely slow for small problems
  82. Incomparability in parallel computation
  83. Incomparability in parallel computation
  84. Evaluating Genetic Algorithms in Protein-Ligand Docking
  85. Lower bounds for (MOD p-MOD m) circuits
  86. Amphiphilic Nature of New Antitubercular Drug Candidates and Their Interaction With Lipid Monolayer