Search PubMed⌕ Search

Biomedical subjects

Manish Sinha

Publications and source records attributed to Manish Sinha.

10 recordsLinked to original sources

Effect of substituents on diarylmethanes for antitubercular activity.

Aminoalkyl derivatives of diarylmethanes were prepared using Grignard, Friedel-Crafts arylation and aminohydrochloride chain formation reactions. These series of compounds were evaluated against Mycobacterium tuberculosis H(37)R(v) and showed the activity in the range of 6.25-25 microg/mL. Effect of heteroaryl, anthracenyl and phenanthrene groups on diarylmethane pharmacophores for antitubercular activity is described.

Animals↗

Meshing small skin grafts manually: a simple, quick, and effective method using Discard-A-Pad.

Meshing a split-thickness skin graft is a very common practice in skin-oncology surgery. Very often, these procedures are done in small facilities where mechanical meshers may not be always available or are too time consuming to unpack and assemble. This paper reports a simple, quick, and effective method of meshing small-sized skin grafts manually using Discard-A-Pad, universally used for sharps disposal. The results thus obtained are comparable to that with a mechanical mesher and a technique very simple to master.

Humans↗

Complete necrosis of allograft ureter after cadaveric renal transplantation.

Complete necrosis of a transplant ureter is a rare complication that needs to be considered early in cases of severe graft dysfunction if successful surgical intervention and restoration of graft function is to be achieved. We report on two cases of this complication occurring in children and discuss the surgical management. Surgical exploration of grafts where there is an early sudden decline in function is imperative as routine imaging will not exclude this potentially treatable problem.

Cadaver↗

On the solution of mixed-integer nonlinear programming models for computer aided molecular design.

This paper addresses the efficient solution of computer aided molecular design (CAMD) problems, which have been posed as mixed-integer nonlinear programming models. The models of interest are those in which the number of linear constraints far exceeds the number of nonlinear constraints, and with most variables participating in the nonconvex terms. As a result global optimization methods are needed. A branch-and-bound algorithm (BB) is proposed that is specifically tailored to solving such problems. In a conventional BB algorithm, branching is performed on all the search variables that appear in the nonlinear terms. This translates to a large number of node traversals. To overcome this problem, we have proposed a new strategy for branching on a set of linear branchingfunctions, which depend linearly on the search variables. This leads to a significant reduction in the dimensionality of the search space. The construction of linear underestimators for a class of functions is also presented. The CAMD problem that is considered is the design of optimal solvents to be used as cleaning agents in lithographic printing.

Journal Article↗