Search PubMed⌕ Search

Biomedical subjects

S Pramanik

Publications and source records attributed to S Pramanik.

At least 19 recordsLinked to original sources
PubMed2006

Apoptosis is induced in leishmanial cells by a novel protein kinase inhibitor withaferin A and is facilitated by apoptotic topoisomerase I-DNA complex.

Protein kinase C (PKC) is an important constituent of the signaling pathways involved in apoptosis. We report here that like staurosporine, withaferin A is a potent inhibitor of PKC. In Leishmania donovani, the inhibition of PKC by withaferin A causes depolarization of DeltaPsim and generates ROS inside cells. Loss of DeltaPsim leads to the release of cytochrome c into the cytosol and subsequently activates caspase-like proteases and oligonucleosomal DNA cleavage. Moreover, in treated cells, oxidative DNA lesions facilitate the stabilization of topoisomerase I-mediated cleavable complexes, which also contribute to DNA fragmentation. However, withaferin A and staurosporine cannot induce cleavable complex formation in vitro with recombinant topoisomerase I nor with nuclear extracts from control cells. Taken together, our results indicate that inhibition of PKC by withaferin A is a central event for the induction of apoptosis and that the stabilization of topoisomerase I-DNA complex is necessary to amplify apoptotic process.

Animals↗
PubMed2005

Determination of gene organization in the human IGHV region on single chromosomes.

Organization of the IGHV genes (n=108) on single human chromosomes has been determined by detecting these sequences in single sperm using multiplex PCR amplification followed by microarray detection. A total of 374 single sperm samples from five Caucasian males were studied. Three deletion/insertion polymorphisms (Del I-Del III) with deletion allele frequencies ranging from 0.1 to 0.3 were identified. Del I is a previously reported polymorphism affecting three IGHV genes (IGHV1-8, IGHV3-9, and IGHV2-10). Del II affects a region 2-18 kb containing two pseudogenes IGHV(II)-28.1 and IGHV3-29, and Del III spans approximately 21-53 kb involving genes IGHV4-39, IGHV7-40, IGHV(II)-40-1, and IGHV3-41. Deletion alleles of both Dels II and III were found in a heterozygous state, and therefore, could not be easily detected if haploid samples were not used in the study. Results of the present study indicate that deletions/insertions together with other possible chromosomal rearrangements may play an important role in forming the genetic structure of the IGHV region, and may significantly contribute to antibody diversity. Since these three polymorphisms are located within or next to the 3' half of the IGHV region, they may have an important role in the expressed IGHV gene repertoire during immune response.

Chromosomes, Human, Pair 14↗
PubMed2004

Postage stamps as a health promotion tool in the Nepalese community.

Over the last 15 years the government of Nepal has issued postage stamps as a way of raising awareness of health issues in the general population and especially in remote communities. The topics covered by 8 different stamps are good child health care practices, combating drug abuse, hazards of smoking, prevention of AIDS, prevention of blindness due to cataract, fighting cancer and rehabilitation of disabled people.

Blindness↗
PubMed2001

Endometrial balloon ablation as a therapy for intractable uterine bleeding in an adolescent.

STUDY OBJECTIVE: To evaluate the use of a minimally invasive global endometrial ablation technique in the management of life-threatening bleeding unresponsive to hormonal treatment. RESULTS: Immediate cessation of bleeding with recovery of normal hematologic profile. CONCLUSIONS: Endometrial ablation by global balloon ablation may be considered an alternative to hysterectomy in life-threatening hemorrhage in the adolescent patient who is unresponsive to hormonal therapy.

Adolescent↗
PubMed2000

The RDP (Ribosomal Database Project) continues.

The Ribosomal Database Project (RDP-II), previously described by Maidak et al., continued during the past year to add new rRNA sequences to the aligned data and to improve the analysis commands. Release 7.1 (September 17, 1999) included more than 10 700 small subunit rRNA sequences. More than 850 type strain sequences were identified and added to the prokaryotic alignment, bringing the total number of type sequences to 3324 representing 2460 different species. Availability of an RDP-II mirror site in Japan is also near completion. RDP-II provides aligned and annotated rRNA sequences, derived phylogenetic trees and taxonomic hierarchies, and analysis services through its WWW server (http://rdp.cme.msu.edu/ ). Analysis services include rRNA probe checking, approx-i-mate phylogenetic placement of user sequences, screening user sequences for possible chimeric rRNA sequences, automated alignment, production of similarity matrices and services to plan and analyze terminal restriction fragment length polymorphism (T-RFLP) experiments.

Databases, Factual↗
PubMed2000

Analysis of CAG and CCG repeats in Huntingtin gene among HD patients and normal populations of India.

We have analysed the distribution of CAG and adjacent polymorphic CCG repeats in the Huntingtin gene in 28 clinically diagnosed unrelated Huntington's disease (HD) patients and in normal individuals belonging to different ethnic groups of India. The range of expanded CAG repeats in HD patients varied from 41 to 56 repeats, whereas in normal individuals this number varied between 11 and 31 repeats. We identified six CCG alleles from a total of 380 normal chromosomes that were pooled across different ethnic populations of India. There were two predominant alleles: (CCG)7 (72.6%) and (CCG)10 (20%). We report here for the first time one four-repeat CCG allele which has not been found in any population so far. We found 30 haplotypes (two loci CAG-CCG) for 380 normal chromosomes. In the present study, no statistically significant preponderance of expanded HD alleles was found on either (CCG)7 or (CCG)10 backgrounds. Our studies suggest that the overall prevalence of HD in Indian populations may not be as high as in Western populations. Further studies are necessary to identify the origin of HD mutation in these populations.

Adolescent↗
PubMed1999

A new version of the RDP (Ribosomal Database Project).

The Ribosomal Database Project (RDP-II), previously described by Maidak et al. [ Nucleic Acids Res. (1997), 25, 109-111], is now hosted by the Center for Microbial Ecology at Michigan State University. RDP-II is a curated database that offers ribosomal RNA (rRNA) nucleotide sequence data in aligned and unaligned forms, analysis services, and associated computer programs. During the past two years, data alignments have been updated and now include >9700 small subunit rRNA sequences. The recent development of an ObjectStore database will provide more rapid updating of data, better data accuracy and increased user access. RDP-II includes phylogenetically ordered alignments of rRNA sequences, derived phylogenetic trees, rRNA secondary structure diagrams, and various software programs for handling, analyzing and displaying alignments and trees. The data are available via anonymous ftp (ftp.cme.msu. edu) and WWW (http://www.cme.msu.edu/RDP). The WWW server provides ribosomal probe checking, approximate phylogenetic placement of user-submitted sequences, screening for possible chimeric rRNA sequences, automated alignment, and a suggested placement of an unknown sequence on an existing phylogenetic tree. Additional utilities also exist at RDP-II, including distance matrix, T-RFLP, and a Java-based viewer of the phylogenetic trees that can be used to create subtrees.

Base Sequence↗
PubMed1999

HICLAS: a taxonomic database system for displaying and comparing biological classification and phylogenetic trees.

MOTIVATION: Numerous database management systems have been developed for processing various taxonomic data bases on biological classification or phylogenetic information. In this paper, we present an integrated system to deal with interacting classifications and phylogenies concerning particular taxonomic groups. RESULTS: An information-theoretic view (taxon view) has been applied to capture taxonomic concepts as taxonomic data entities. A data model which is suitable for supporting semantically interacting dynamic views of hierarchic classifications and a query method for interacting classifications have been developed. The concept of taxonomic view and the data model can also be expanded to carry phylogenetic information in phylogenetic trees. We have designed a prototype taxonomic database system called HICLAS (HIerarchical CLAssification System) based on the concept of taxon view, and the data models and query methods have been designed and implemented. This system can be effectively used in the taxonomic revisionary process, especially when databases are being constructed by specialists in particular groups, and the system can be used to compare classifications and phylogenetic trees. AVAILABILITY: Freely available at the WWW URL: http://aims.cps.msu.edu/hiclas/ CONTACT: pramanik@cps.msu.edu; lotus@wipm.whcnc.ac.cn

Classification↗
PubMed1999

Negligible male gene flow across ethnic boundaries in India, revealed by analysis of Y-chromosomal DNA polymorphisms.

From the historically prevalent social structure of Indian populations it may be predicted that there has been very little male gene flow across ethnic boundaries. To test this finding, we have analyzed DNA samples of individuals belonging to 10 ethnic groups, speaking Indo-European or Austroasiatic languages and inhabiting the eastern and northern regions of India. Eight Y-chromosomal markers, two biallelic and six microsatellite, were studied. All populations were monomorphic for the deletion allele at the YAP (DYS287) locus and for the 119-bp allele at the DYS288 locus. Y-chromosomal haplotypes were constructed on the basis of one RFLP locus and five microsatellite loci. The haplotype distribution among the groups showed that different ethnic groups harbor nearly disjoint sets of haplotypes. This indicates that there has been virtually no male gene flow among ethnic groups. Analysis of molecular variance revealed that there was significant haplotypic variation between castes and tribes, but nonsignificant variation among ranked caste clusters. Haplotypic variation attributable to differences in geographical regions of habitat was also nonsignificant.

DNA↗
PubMed1998

Informed consent for clinical trials: a comparative study of standard versus simplified forms.

BACKGROUND: A high level of reading skill and comprehension is necessary to understand and complete most consent forms that are required for participation in clinical research studies. This study was conducted to test the hypothesis that a simplified consent form would be less intimidating and more easily understood by individuals with low-to-marginal reading skills. METHODS: During July 1996, 183 adults (53 patients with cancer or another medical condition and 130 apparently healthy participants) were tested for reading ability and then asked to read either the standard Southwestern Oncology Group (SWOG) consent form (16th grade level) or a simplified form (7th grade level) developed at Louisiana State University Medical Center-Shreveport (LSU). Participants were interviewed to assess their attitudes toward and comprehension of the form read. Then they were given the alternate consent form and asked which one they preferred and why. RESULTS: Overall, participants preferred the LSU form (62%; 95% confidence interval [CI] = 54.8%-69.2%) over the SWOG form (38%; 95% CI = 30.8%-45.2%) (P = .0033). Nearly all participants thought that the LSU form was easier to read (97%; 95% CI = 93.1%-99.9%) than the SWOG form (75%; 95% CI = 65.1%-85.7%) (P<.0001). However, the degree to which the participants understood the forms was essentially the same for the LSU form (58%; 95% CI = 48.6%-67.0%) and the SWOG form (56%; 95% CI = 43.8%-66.8%). IMPLICATIONS: These findings raise serious questions regarding the adequacy of the design of written informed consent documents for the substantial proportion of Americans with low-to-marginal literacy skills.

Adult↗
PubMed1997

A general method for tree-comparison based on subtree similarity and its use in a taxonomic database.

A number of metrics for comparing the branching structure of trees have been used as important tools in the quantitative analysis of evolutionary trees. Less attention has been paid to developing a general comparison methodology for different leaf-labeled N-trees such as classification trees and various types of dendrograms. In this paper a method for measuring overall similarity based on subtree similarity is proposed. Association coefficients can be used to measure the similarity between each pair of subtrees in two trees, and an algorithm called the 'webbing matrix method' is outlined in order to calculate the overall similarity in this method. In addition, the use of this method for tree searching and tree comparison in a taxonomic database is introduced.

Animals↗
PubMed1996

Peroxidase changes in barley induced by ionizing and thermal radiation.

Thermal and ionizing (gamma-ray) radiations were used to induce damage to barley seeds (IB65). The activity and isozyme banding patterns of peroxidase were compared. It was found that both physical agents caused damage to barley seeds (as observed from seedling height), but their action on peroxidase activity is not similar. Gamma-Rays enhance peroxidase activity. Thermal radiation, on the other hand, tends to reduce it but fails to alter the number of peroxidase isozymes. It is conjectured that the pathways of damage by thermal and ionizing radiations are not the same.

Gamma Rays↗
PubMed1996

Alignment of possible secondary structures in multiple RNA sequences using simulated annealing.

Multiple sequence alignment has been a useful technique for identifying RNA secondary structures. In this paper, an algorithm for aligning multiple RNA sequences to identify possible secondary structure is presented. In this algorithm, dot matrices generated from intra-sequence comparisons are used to obtain possible common secondary structures. A hit probability for dot matrices is calculated and a score function based on this hit probability is defined. Simulated annealing is applied to optimize the score function. The solution set of multiple sequence alignment is introduced, and the effects on the solution set of increasing the number of alignment gaps and the alignment length are analyzed. Several additional strategies to reduce simulated annealing time are applied. A method is applied to reduce the computation time based on the solution set. Also, an optimized transition rule, double shuffle, which moves two positions in a sequence with each iteration, is applied to increase the rate of convergence. This algorithm was used to find possible common secondary structures in RNA sequences.

Algorithms↗
PubMed1996

Inferring relatedness of a macromolecule to a sequence database without sequencing.

Derivation of biological information of a macromolecule isolate based on sequence similarity is playing a significant role in numerous areas of biological research. However, it is often the case that a researcher obtains more macromolecule isolates than can be sequenced practically, due either to the high cost of sequencing or lack of specialized equipment and personnel. To overcome this difficulty, we study the problem of obtaining biological information (such as sequence information) about a macromolecule isolate using only (i) the fragmentation pattern of that isolate obtained from digestion with enzymes and (ii) a database D of sequences. We investigate a three phase approach to solving this problem. In the first phase, we obtain a restriction pattern of the isolate while analytically deriving the corresponding restriction maps of the sequences in the database. In the second phase, we identify a set S [symbol: see text] D of sequences which have restriction maps that are most similar to the unknown isolate's restriction pattern. This task is complicated by the fact that we have only approximate fragment lengths for the unknown isolate and that we do not know the actual ordering of the unknown isolate's fragments. Despite these difficulties, we derive experimental results which indicate maximum matching techniques are effective in identifying the correct set most of the time. In the third phase, we use the set S to infer biological information (such as sequence information or hierarchical classification information) about the unknown isolate. We demonstrate experimentally that the closeness of the sequences in the set S to each other can be used to infer the relatedness of the unknown isolate to the sequences of the set S. Furthermore, the confidence of this inferred information is strongly correlated to the minimum pairwise relatedness of any two elements in S.

Databases, Factual↗
PubMed1995

A new data model for biological classification.

In the domain of biological classification, classifications are performed hierarchically. There are no standard classifications which are unanimously accepted by the community of each domain; many different interacting views of classification exist about the same data, and the discovery of new data results in changes to the existing classification. Even a single individual may change his or her own classification of a particular group. Since multiple classification views interact, they are semantically related. It is difficult to model this kind of dynamically evolving and semantically interacting classification system using traditional data models, which lack the structural flexibility necessary to support dynamic views of hierarchic classifications, and cannot properly capture the history of these complex interactions. We have developed a new data model which is suitable for supporting semantically interacting dynamic views of hierarchic biological classifications. On the basis of our new data model we have developed a prototype database system called HICLAS (HIerarchical CLAssification System); its domain is plant taxonomy. HICLAS is available through the Internet and an X-window interface has been implemented to support queries to classification data.

Classification↗
PubMed1994

Multiple sequence alignment using simulated annealing.

Multiple sequence alignment is a useful technique for studying molecular evolution and analyzing structure-sequence relationships. Dynamic programming of multiple sequence alignment has been widely used to find an optimal alignment. However, dynamic programming does not allow for certain types of gap costs, and it limits the number of sequences that can be aligned due to its high computational complexity. The focus of this paper is to use simulated annealing as the basis for developing an efficient multiple sequence alignment algorithm. An algorithm called Multiple Sequence Alignment using Simulated Annealing (MSASA) has been developed. The computational complexity of MSASA is significantly reduced by replacing the high-temperature phase of the annealing process by a fast heuristic algorithm. This heuristic algorithm facilitates in minimizing the solution set of the low-temperature phase of the annealing process. Compared to the dynamic programming approach, MSASA can (i) use natural gap costs which can generate better solution, (ii) align more sequences and (iii) take less computation time.

Algorithms↗
PubMed1994

An efficient method for multiple sequence alignment.

Multiple sequence alignment has been a useful method in the study of molecular evolution and sequence-structure relationships. This paper presents a new method for multiple sequence alignment based on simulated annealing technique. Dynamic programming has been widely used to find an optimal alignment. However, dynamic programming has several limitations to obtain optimal alignment. It requires long computation time and cannot apply certain types of cost functions. We describe detail mechanisms of simulated annealing for multiple sequence alignment problem. It is shown that simulated annealing can be an effective approach to overcome the limitations of dynamic programming in multiple sequence alignment problem.

Algorithms↗