PubMed Health⌕ Search

PubMed · 10845285

A classification system and algorithm for reconstruction of maxillectomy and midfacial defects.

Abstract

Maxillectomy defects become more complex when critical structures such as the orbit, globe, and cranial base are resected, and reconstruction with distant tissues becomes essential. This study reviews all maxillectomy defects reconstructed immediately using pedicled and free flaps to establish (1) a classification system and (2) an algorithm for reconstruction of these complex problems. Over a 5-year period, 60 flaps were used to reconstruct defects classified as the following: type I, limited maxillectomy (n = 7); type II, subtotal maxillectomy (n = 10); type IIIa, total maxillectomy with preservation of the orbital contents (n = 13); type IIIb, total maxillectomy with orbital exenteration (n = 18); and type IV, orbitomaxillectomy (n = 10). Free flaps (45 rectus abdominis and 10 radial forearm) were used in 55 patients (91.7 percent), and the temporalis muscle was transposed in five elderly patients who were not free-flap candidates. Vascularized (radial forearm osteocutaneous) bone flaps were used in four of the 60 patients (6.7 percent) and nonvascularized bone grafts in 17 (28.3 percent). Simultaneous reconstruction of the oral commissure using an Estandler procedure was performed in 10 patients with maxillectomy and through-and-through soft-tissue defects. Free-flap survival was 100 percent, with reexploration in five of 55 patients (9.1 percent) and partial-flap necrosis in one patient. Seven of the 60 patients (11.7 percent) had systemic complications, and four died within 30 days of hospitalization. Fifty patients had more than 6 months of follow-up with a mean time of 27.7 (+/- 15.6) months. Postoperative radiotherapy was administered in 32 of these patients (64.0 percent). Chewing and speech functions were assessed in 36 patients with type II, IIIa, and IIIb defects. A prosthetic denture was fixed in 15 of 36 patients (41.7 percent). Return to an unrestricted diet was seen in 16 patients (44.4 percent), a soft diet in 17 (47.2 percent), and a liquid diet in three (8.3 percent). Speech was assessed as normal in 14 of 36 patients (38.9 percent), near normal in 15 (41.7 percent), intelligible in six (16.7 percent), and unintelligible in one patient (2.8 percent). Globe and periorbital soft-tissue position was assessed in 14 patients with type I and IIIa defects. There were no cases of enophthalmos, and one patient had a mild vertical dystopia. Ectropion was observed in 10 of 14 patients (71.4 percent). Oral competence was considered good in all 10 patients with excision/reconstruction of the oral commissure; however, two patients (20 percent) developed microstomia after receiving radiotherapy. Aesthetic results were evaluated at least 6 months after reconstruction in 50 patients. They were good to excellent in 29 patients (58 percent) for whom cheek skin and lip were not resected, and poor to fair (42 percent) when the external skin or orbital contents were excised. Secondary procedures were required in 16 of 50 patients (32.0 percent). Free-tissue transfer provides the most effective and reliable form of immediate reconstruction for complex maxillectomy defects. The rectus abdominis and radial forearm flaps in combination with immediate bone grafting or as osteocutaneous flaps reliably provide the best aesthetic and functional results. An algorithm based on the type of maxillary resection can be followed to determine the best approach to reconstruction.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

P G Cordeiro, E Santamaria. 2000. A classification system and algorithm for reconstruction of maxillectomy and midfacial defects.. https://doi.org/10.1097/00006534-200006000-00004

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↗