PubMed Health⌕ Search

PubMed · 9795013

Evaluation and comparison of dissolution data derived from different modified release dosage forms: an alternative method.

Abstract

Dissolution testing is an essential requirement for the development, establishment of in vitro dissolution and in vivo performance (IVIVR), registration and quality control of solid oral dosage forms. The objective of the present study was to investigate the effect of delivery system positioning in accordance with the USP 23-recommended dissolution methods and the proposed modification on drug release from controlled release systems having different operating release mechanisms, namely, swellable floatable, swellable sticking and osmotic pump. The delivery systems were evaluated by placing each dosage form either in the dissolution vessel in accordance with the USP 23 methods or over/below a designed ring/mesh device for achieving full surface exposure to the dissolution medium for sticking or floatable systems respectively. Results indicate that the overall release profiles from the sticking and floatable systems of theophylline are sensitive to their positioning in the dissolution vessel (P<0.05). Furthermore, release of diltiazem hydrochloride from the sticking system also demonstrated sensitivity (P<0.05). In contrast, the floatable dosage form of this latter drug with the application of a helical wire sinker, or when it was placed below the ring/mesh assembly, or by allowing the dosage form to float, did not show sensitivity (P>0.05) for the overall release behavior. This was attributed to the greater solubility of diltiazem hydrochloride (50% solubility in water at 25 degreesC) in comparison to theophylline which is a sparingly soluble drug (0.85% solubility in water at 25 degreesC). Drug release from the osmotic pump appeared to be identical under the given experimental conditions (P>0.05). Statistical analysis of data was performed by comparing the t50%, t70%, t90%; mean dissolution times (MDT50%, MDT70%, MDT90%); the "difference factor, f1" and "similarity factor, f2". It is concluded that the results derived from the application of the "similarity factor, f2" are superior to the individual time points (e.g. tx%) and MDTx% values in differentiating between overall release patterns or the border line release profile differences. It also became apparent that in the case of the swellable sticking systems full surface exposure to the dissolution medium results in greater release rate. For the osmotic pump the required osmotic pressure threshold necessary for constant rate drug delivery appears to have reached independent of the hydrodynamic conditions. A successful and more accurate evaluation of dissolution data can be derived when full surface exposure is considered and this can be accomplished by dissolution method modification with the aid of the designed ring/mesh assembly.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

V Pillay, R Fassihi. 1998-10-30. Evaluation and comparison of dissolution data derived from different modified release dosage forms: an alternative method.. https://doi.org/10.1016/s0168-3659(98)00022-4

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6&#xd7; to 17.6&#xd7; faster than POASTA, and 7.3&#xd7; faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9&#xd7; to 16.9&#xd7; speedup on short reads. Moreover, Theseus is 1.5&#xd7; to 36.3&#xd7; faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗