Animesh Sarker

  • Citations Per Year
Learn More
The point placement problem is to determine the positions of a linear set of points, P = {p1, p2, p3, . . . , pn}, uniquely, up to translation and reflection, from the fewest possible distance queries between pairs of points. Each distance query corresponds to an edge in a graph, called point placement graph (ppg), whose vertex set is P . The uniqueness(More)
Pseudomonas aeruginosa is one of the most common pathogenic bacteria, frequently found in different environmental samples. The prevalence of multidrug resistant isolates has become an alarming concern for both patients and their surroundings. The present study was carried out to record prevalence of P. aeruginosa in surface water of Dhaka city and to screen(More)
A bioinformatics finding shows that numerous human heat shock proteins (HSPs) homologues are common in plants. Human heat shock proteins (HSPs), which are expressed to higher temperature or other stress, have chaperone activity belong to four conserved classes: HSP60, HSP70, HSP90 and HSP100. Bioinformatics blast search reveals that each of the human HSP(More)
Helicobacter pylori are gut bacteria colonize in the epithelial cell lining of the stomach and persist there for long duration. Around two-thirds of the world’s populations are infected with H. pylori and cause more than 90 percent of ulcers. The development of persistent inflammation is the main cause of chronic gastritis that finally results in a severe(More)
In [11] Zarrabi-Zadeh and Chan proposed an algorithm to compute an approximate minimum spanning ball in the streaming model of computation and showed by an elegant analysis that the radius of the approximate ball is to within 3/2 of the exact one. Inspired by this result, in this paper we consider the extension of this result to computing approximate(More)
  • 1