PubMed Health⌕ Search

PubMed · 15336464

A treatment algorithm for neuropathic pain.

Abstract

BACKGROUND: Neuropathic pain is a chronic pain syndrome caused by drug-, disease-, or injury-induced damage or destruction of sensory neurons within the dorsal root ganglia of the peripheral nervous system. Characteristic clinical symptoms include the feeling of pins and needles; burning, shooting, and/or stabbing pain with or without throbbing; and numbness. Neuronal hyperexcitability represents the hallmark cellular mechanism involved in the underlying pathophysiology of neuropathic pain. Although the primary goal is to alleviate pain, clinicians recognize that even the most appropriate treatment strategy may be, at best, only able to reduce pain to a more tolerable level. OBJECTIVE: The purpose of this review is to propose a treatment algorithm for neuropathic pain that health care professionals can logically follow and adapt to the specific needs of each patient. The algorithm is intended to serve as a general guide to assist clinicians in optimizing available therapeutic options. METHODS: A comprehensive review of the literature using the PubMed, MEDLINE, Cochrane, and Toxnet databases was conducted to design and develop a novel treatment algorithm for neuropathic pain that encompasses agents from several drug classes, including antidepressants, antiepileptic drugs, topical antineuralgic agents, narcotics, and analgesics, as well as various treatment options for refractory cases. RESULTS: Any of the agents in the first-line drug classes (tricyclic antidepressants, antiepileptic drugs, topical antineuralgics, analgesics) may be used as a starting point in the treatment of neuropathic pain. If a patient does not respond to treatment with at least 3 different agents within a drug class, agents from a second drug class may be tried. When all first-line options have been exhausted, narcotic analgesics or refractory treatment options may provide some benefit. Patients who do not respond to monotherapy with any of the first- or second-line agents may respond to combination therapy or may be candidates for referral to a pain clinic. Because the techniques used at pain clinics tend to be invasive, referrals to these clinics should be reserved for patients who are truly refractory to all forms of pharmacotherapy. CONCLUSIONS: Neuropathic pain continues to be one of the most difficult pain conditions to treat. With the proposed algorithm, clinicians will have a framework from which to design a pain treatment protocol appropriate for each patient. The algorithm will also help streamline referrals to specialized pain clinics, thereby reducing waiting list times for patients who are truly refractory to traditional pharmacotherapy.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mike Namaka, Colin R Gramlich, Dana Ruhlen, Maria Melanson, Ian Sutton, Joanne Major. 2004. A treatment algorithm for neuropathic pain.. https://doi.org/10.1016/s0149-2918(04)90171-3

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× to 17.6× faster than POASTA, and 7.3× 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× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× 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↗