A mathematical approach to the optimal examination of lymph nodes
Ahn CY, Kim SH, Jang SJ, Hong SW, Kim H, Lim BJ. A mathematical approach to the optimal examination of lymph nodes. APMIS 2011; 119: 868–76. There is no scientific evidence to support the idea that serial sectioning along the short axis of the lymph node is superior to a single bisection along the l...
Gespeichert in:
Veröffentlicht in: | APMIS : acta pathologica, microbiologica et immunologica Scandinavica microbiologica et immunologica Scandinavica, 2011-12, Vol.119 (12), p.868-876 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Ahn CY, Kim SH, Jang SJ, Hong SW, Kim H, Lim BJ. A mathematical approach to the optimal examination of lymph nodes. APMIS 2011; 119: 868–76.
There is no scientific evidence to support the idea that serial sectioning along the short axis of the lymph node is superior to a single bisection along the long axis. We mathematically evaluated methods of lymph node dissection and applied the result to six lymph nodes that had produced false negative results at the time of frozen examination. We simplified the geometry of a lymph node to that of a three‐dimensional ellipse and compared two different cutting methods. Let A be the cross‐sectional area obtained through a single bisection along the long axis, and let B be the sum of the cross‐sectional areas of n fragments obtained via serial cutting along the short axis. The smallest n (n*) that makes a B larger than A can be calculated. (, the smallest integer greater than or equal to α; L, long axis; S, short axis). The probabilities of tumor detection when the node is bisected along the long axis (P(DA|E)) and when serially cut along the short axis (P(DB|E)) are as follows. and (T, size of the tumor cell cluster). According to these formulas, three out of six lymph nodes were not examined in the most appropriate manner. |
---|---|
ISSN: | 0903-4641 1600-0463 |
DOI: | 10.1111/j.1600-0463.2011.02795.x |