in 1998 kononen and colleagues published in nature medicine , the results of a high throughput analysis of tumor cases , named tissue micro array ( tma ) technology , via an ingenious substantial modification of a previous method , of transferring cores from several donor blocks into a virgin unique acceptor as replicated samples identified by the position in the rows and columns of the array .
three thousand and counting publications later , the tma technology has fulfilled the promises of high throughput analytical ability .
the inbuilt geometry of the design and the unsophisticated execution has favoured a practical approach : common sense , histotechnology expertise and unwritten tips rather than written standards .
it is therefore not surprising that the intrinsic analytical error rate has never been addressed and the standards for design and construction , either for diagnosis or for research , have never been defined , except for cooperative large - scale studies , or for the data exchange specification.[46 ] notably , none of these methodology suggestions addresses how to control for errors in matching individual samples on the slide with its own data or how safely track those data , except for a quote about asymmetry in order to prevent map orientation confusion
. published data about the analytical error rate in tma are lacking ; unpublished estimates suggests that 1 in 5,000 to 10,0000 samples may be misidentified , even using printed blocks and barcode - driven sample ids ( stephen m hewitt , personal communication ) .
more frequently , lack of correspondence between cored - out samples and the original block are attributed to tissue heterogeneity , totally ignoring the contribution of sample switching .
the technique is evidently assumed to be totally accurate in identifying each and every single spot ; the occurrence of tissue heterogeneity and the high - throughput ability masks and overcomes small individual error - driven experimental noise .
therefore formal demonstration that superimposing a tma design onto the tma slide image results in validation of the individual components has never been made . as a consequence ,
reports of diagnostic use of the tma , where positive identification of a patient is crucial , are scarce .
this report addresses and solves error control issues and provides scientific ground to the use of the tma technology for diagnostic but for industrial or scientific purposes as well .
the laboratory information system ( lis ) in use in our department ( athena , noemalife spa , bologna , italy ) identifies each object with an unique identification ( i d ) number , including an 8 digit numeric slide i d .
patient and specimen data are entered into the lis , creating unique ids for accession number , procedure , specimen , tissue block , tissue slides , etc .
the lis interface was modified to print its unique i d onto the label of each slide as a code 128c high density linear barcode , via a label printer ( datamax m4206 ) .
we chose to use the tissue slide instead of the tissue block for barcoding because the slide is the item on which the pathologist marks areas to be sampled . matching
the slide with the corresponding block is a standard procedure in histology , which entails two separate and qualitatively distinct procedures totalling 6 seconds or less : matching first the complete ids on the label and on the block , then matching the shape of the tissue on the slide with the one on the corresponding block .
the pathologist would chose which sample and which area of the sample would be arrayed and a set of marked , barcoded slides would be forwarded to the technician in charge of arraying .
we next generated a query on the lis database ( based on oracle 10.2 ) , which extracts from the database five items ( slide i d , block number , case number , patient i d and date in which the sample was received ) , when prompted by the i d scanned on the tissue slide [ figure 1 ] .
the query is exported as an excel file , to be acquired by the tissue arrayer software in the donor block database .
note that none of the records we chose to be inserted in the file allows identification of the patient by a third unauthorized party .
the amount of information extracted from the lis is limited only by the dimension of the field in the database .
tma construction through individual case segmentation flow process the figure depicts the flow of samples , images and data through the process .
note that there is no access to the wsi database which does not pass through a barcode reader check ( the wand symbol ) .
a final reconciliation of the data contained in the design with the individual cores in the wsi is done by barcode - driven match between the wsi and its own unique design barcode reading was accomplished with a common hand held linear barcode reader .
the file containing the 5 informative items of the donor tissue , is drag into the open window of the galileo tma program ( tissue microarrayer model tma galileo ck4500 ; integrated systems engineering srl , milano , italy ) , populating automatically all the donor block fields .
next , before the design of the tma begins , the galileo software requests that the i d of the tma acceptor block is inserted ; this is accomplished by barcode scanning a 5 digit alphanumeric unique tma i d , previously generated by a tma database separated from the lis , printed and inserted into the back of the virgin acceptor block [ figure 1 ] . the same barcode i d is then printed together with alphanumeric date , stain , etc on a label glued on each section cut from that tma [ figure 1 ] .
the tma array is purposely designed with an intrinsic asymmetry , i.e. transformation of the geometry by reflection along the axis generate new , readily distinguishable geometric forms .
care is taken so that the asymmetry produced by inserting or emptying spots is not lost upon accidental loss of single spots or rows on the slide . during the tma design construction with the galileo software ,
the design is a bi - dimensional matrix of n  m positions , in which each full spot may be considered  1  and the empty one  0  .
we define as i and j the indexes identifying the matricial design and a ( ) each element , which is then a 
 ( i , j)=0 | 1 where 0<i < m e 0<j < n . by applying to the matrix each of the 7 possible transformations [ table 1 ] , it is possible to calculate the robustness of the asymmetry by calculating the ensuing superimpositions of full and empty spots and ranking the safety of the design . a simple computer program can easily loop through all the possible transformations and count the number of spots that do not overlap after each change .
a rank of 0 discards the design because there is at least one symmetric transformation , thus a chance of error [ figure 2 ] .
listing of the possible transformations of the tma design consisting of a square array , a design less favourable than a rectangular one ranking the asymmetry of the tma design the figure depicts pair wise comparisons ( top , bottom ) of tma design with sectors ( left ) and solid ( right ) . in all of them ,
empty spots are marked as  0  , filled ones as  1  .
left of each design are listed the seven transformations (  ) and the calculated rank of that transformation ( see text ) .
a rank of  o  in any permutation will result in discarding the design , because of symmetry the source of asymmetry is consistently placed in one fixed position ( e.g. lower right corner ) , to facilitate the correct orientation of the tma image before segmenting .
the use of random placement of the samples makes the use of sectors unnecessary ; in addition , empty rows or lines within the design run the risk of misidentify spots in case the tma section is particularly wavy or disrupted .
upon tma completion , two types of files are generated : an excel file containing the tma design , the list of all samples and relative data and an xml file , in which the same data are coded in a format readable by the software of the whole slide scanner .
the galileo tma software natively generates files in the tma des ( data exchange specification ) xml format .
the xml file is imported in spectrum ( aperio technologies , vista , ca , usa ) in a designed database , and each xml tag is addressed to a designed field in the database .
the aperio slide scanner acquires the whole slide image ( wsi ) of the tma and the tma barcode on the label [ figure 1 ] and stores both in the spectrum database .
additional information can be added to the software by the investigator , before or after the image analysis .
to ensure exact matching of all patient 's i d data with the corresponding sample images , the spectrum software was modified so that the match of the i d in the design and the i d on the wsi [ figure 1 ] is highlighted , leaving to the operator the choice to hit the  segment  command . without a match ,
once the correct rotation of the wsi is defined by placing the source of asymmetry in the pre - defined corner , the grid of the design is adjusted to accommodate the shearing that may take place when the 4 m section is placed on the glass slide and to fit all the available spots on the wsi .
the laboratory information system ( lis ) in use in our department ( athena , noemalife spa , bologna , italy ) identifies each object with an unique identification ( i d ) number , including an 8 digit numeric slide i d .
patient and specimen data are entered into the lis , creating unique ids for accession number , procedure , specimen , tissue block , tissue slides , etc .
the lis interface was modified to print its unique i d onto the label of each slide as a code 128c high density linear barcode , via a label printer ( datamax m4206 ) .
we chose to use the tissue slide instead of the tissue block for barcoding because the slide is the item on which the pathologist marks areas to be sampled . matching
the slide with the corresponding block is a standard procedure in histology , which entails two separate and qualitatively distinct procedures totalling 6 seconds or less : matching first the complete ids on the label and on the block , then matching the shape of the tissue on the slide with the one on the corresponding block .
the pathologist would chose which sample and which area of the sample would be arrayed and a set of marked , barcoded slides would be forwarded to the technician in charge of arraying .
we next generated a query on the lis database ( based on oracle 10.2 ) , which extracts from the database five items ( slide i d , block number , case number , patient i d and date in which the sample was received ) , when prompted by the i d scanned on the tissue slide [ figure 1 ] .
the query is exported as an excel file , to be acquired by the tissue arrayer software in the donor block database .
note that none of the records we chose to be inserted in the file allows identification of the patient by a third unauthorized party .
the amount of information extracted from the lis is limited only by the dimension of the field in the database .
tma construction through individual case segmentation flow process the figure depicts the flow of samples , images and data through the process .
note that there is no access to the wsi database which does not pass through a barcode reader check ( the wand symbol ) .
a final reconciliation of the data contained in the design with the individual cores in the wsi is done by barcode - driven match between the wsi and its own unique design barcode reading was accomplished with a common hand held linear barcode reader .
the file containing the 5 informative items of the donor tissue , is drag into the open window of the galileo tma program ( tissue microarrayer model tma galileo ck4500 ; integrated systems engineering srl , milano , italy ) , populating automatically all the donor block fields .
next , before the design of the tma begins , the galileo software requests that the i d of the tma acceptor block is inserted ; this is accomplished by barcode scanning a 5 digit alphanumeric unique tma i d , previously generated by a tma database separated from the lis , printed and inserted into the back of the virgin acceptor block [ figure 1 ] . the same barcode i d is then printed together with alphanumeric date , stain , etc on a label glued on each section cut from that tma [ figure 1 ] .
the tma array is purposely designed with an intrinsic asymmetry , i.e. transformation of the geometry by reflection along the axis generate new , readily distinguishable geometric forms .
care is taken so that the asymmetry produced by inserting or emptying spots is not lost upon accidental loss of single spots or rows on the slide . during the tma design construction with the galileo software ,
the design is a bi - dimensional matrix of n  m positions , in which each full spot may be considered  1  and the empty one  0  .
we define as i and j the indexes identifying the matricial design and a ( ) each element , which is then a 
 ( i , j)=0 | 1 where 0<i < m e 0<j < n . by applying to the matrix each of the 7 possible transformations [ table 1 ] , it is possible to calculate the robustness of the asymmetry by calculating the ensuing superimpositions of full and empty spots and ranking the safety of the design .
a simple computer program can easily loop through all the possible transformations and count the number of spots that do not overlap after each change .
a rank of 0 discards the design because there is at least one symmetric transformation , thus a chance of error [ figure 2 ] .
listing of the possible transformations of the tma design consisting of a square array , a design less favourable than a rectangular one ranking the asymmetry of the tma design the figure depicts pair wise comparisons ( top , bottom ) of tma design with sectors ( left ) and solid ( right ) . in all of them ,
empty spots are marked as  0  , filled ones as  1  .
left of each design are listed the seven transformations (  ) and the calculated rank of that transformation ( see text ) .
a rank of  o  in any permutation will result in discarding the design , because of symmetry the source of asymmetry is consistently placed in one fixed position ( e.g. lower right corner ) , to facilitate the correct orientation of the tma image before segmenting .
the use of random placement of the samples makes the use of sectors unnecessary ; in addition , empty rows or lines within the design run the risk of misidentify spots in case the tma section is particularly wavy or disrupted .
upon tma completion , two types of files are generated : an excel file containing the tma design , the list of all samples and relative data and an xml file , in which the same data are coded in a format readable by the software of the whole slide scanner .
the galileo tma software natively generates files in the tma des ( data exchange specification ) xml format .
the xml file is imported in spectrum ( aperio technologies , vista , ca , usa ) in a designed database , and each xml tag is addressed to a designed field in the database .
the aperio slide scanner acquires the whole slide image ( wsi ) of the tma and the tma barcode on the label [ figure 1 ] and stores both in the spectrum database .
additional information can be added to the software by the investigator , before or after the image analysis .
to ensure exact matching of all patient 's i d data with the corresponding sample images , the spectrum software was modified so that the match of the i d in the design and the i d on the wsi [ figure 1 ] is highlighted , leaving to the operator the choice to hit the  segment  command . without a match ,
once the correct rotation of the wsi is defined by placing the source of asymmetry in the pre - defined corner , the grid of the design is adjusted to accommodate the shearing that may take place when the 4 m section is placed on the glass slide and to fit all the available spots on the wsi .
we took a mathematical approach to the question on how to validate matching the grid containing the patient 's i d and data ( the tma construction design ) with the image of the tma stained section .
( intuitively , it has no nontrivial isometries ) , provided it satisfies two , easy to check , conditions .
we set the following standard notation :  is the real line ,  the plane    endowed by the euclidean distance , [ a , b ] is the straight segment from the point a to the point b in . we prove the following statement : let r be a finite , hence discrete , set of points in  , such that the two following two properties hold . 

let lpq be the line through the points p , q ; consider the set s of all the segments [ p , q ] , p , q  r with the property that one of the two connected components of   lpq has empty intersection with . then we require the existence of a segment [ a , b ]  s whose length is unique among the lengths of the other segments in s.let [ a , b ] , a , b  r be the unique segment of length n in s. then r should not be symmetrical with respect to the axis perpendicular to [ a , b ] through its midpoint . 
 
let lpq be the line through the points p , q ; consider the set s of all the segments [ p , q ] , p , q  r with the property that one of the two connected components of   lpq has empty intersection with . then we require the existence of a segment [ a , b ]  s whose length is unique among the lengths of the other segments in s. let [ a , b ] , a , b  r be the unique segment of length n in s. then r should not be symmetrical with respect to the axis perpendicular to [ a , b ] through its midpoint .
then if  :    is an isometry such that  ( r)= r ,  must be the identity function .
we recall than an isometry in  is a function f such that de(x , y)=de(f(x ) , f(y ) ) for all ( x , y )   , where de is the euclidean distance in . they include ( and are in fact generated by ) all reflections , rotations and translations .
this statement is false if we require  to be a homeomorphism ( i.e. bijective and bicontinuous function ) only .
proof : being  an isometry , it sends lines in lines , thus  ( [ a , b ] ) is a segment connecting the two points  ( a ) and  ( b ) in r. because of the continuity of  , there exists a connected component of  l(a)(b ) with empty intersection with r , since so does   lab .
therefore [  ( a ) ,  ( b ) ] belongs to the set s , as we are assuming (r)=r .
the length of such a segment must be the same as the length of [ a , b ] , again because  is an isometry . by the unicity of the segments in s of length n ( condition ( 1 ) on r ) , it must be [  ( a ) ,  ( b ) ] = [ a , b ] and  restricted to [ a , b ] is an isometry onto [ a , b ]
. either of the following cases must necessarily happen : 
  ( a ) = a and  ( b ) = b. then  restricted to the line lab is an isometry onto lab itself that fixes two points , therefore it must be the identity on the same line .
this leaves only one non trivial possibility for  as map on  : a reflection along the lab axis .
but in that case , it is impossible that  ( r ) = r , since  would swap the connected components of  lab and the points in r not in lab are all contained in one component .
this leaves  = identity on the whole plane  as the only possibility. ( a ) = b and  ( b ) = a. then  must have at least a fixed point , which must necessarily be the middle point m of [ a , b ] since  is assumed to be an isometry . thus it must either be a rotation by  around m , in which case  ( r )  r because  swaps the connected components of  lab , or else a reflection through the line perpendicular to [ a , b ] through m. however , the condition ( 2 ) on r implies that  ( r )  r for such an isometry . 
 
 ( a ) = a and  ( b ) = b. then  restricted to the line lab is an isometry onto lab itself that fixes two points , therefore it must be the identity on the same line .
this leaves only one non trivial possibility for  as map on  : a reflection along the lab axis .
but in that case , it is impossible that  ( r ) = r , since  would swap the connected components of  lab and the points in r not in lab are all contained in one component .
 ( a ) = b and  ( b ) = a. then  must have at least a fixed point , which must necessarily be the middle point m of [ a , b ] since  is assumed to be an isometry . thus it must either be a rotation by  around m ,
in which case  ( r )  r because  swaps the connected components of  lab , or else a reflection through the line perpendicular to [ a , b ] through m. however , the condition ( 2 ) on r implies that  ( r )  r for such an isometry .
this shows that the only possible isometry  of  such that  ( r ) = r is the identity function .
think of an array of specimens placed in glass slide as the finite set r satisfying the conditions ( 1 ) and ( 2 ) .
assume the shape of the slide to be unknown and that the array is placed randomly on it .
this result implies that , choosing any labelling of the specimens and applying an unknown sequence of integrity - preserving transformations to the slide , to recover the initial labelling of the specimens it suffices to move the slide around until the shape of the array matches the original one .
the conditions ( 1 ) and ( 2 ) are isometry invariant , meaning that , they hold for a set r if and only if they hold for  ( r ) , where  is any isometry of . as a consequence , the array of specimens , when glued on the slide , will be strongly asymmetrical , provided the initial ( computer generated ) one was and all the processing involved in the slide preparation can be assumed to transform the array only just through isometries . the easiest examples of lattices satisfying the conditions ( 1 ) and ( 2 ) are rect - angular ones with sides lengths c  d with an extra specimen added in a length c boundary row .
for that array we can take n to be c + 1 and immediately verify that the conditions are fulfilled . appropriately removing blocks of points from one corner of a rectagular array , with sufficiently many rows and columns ,
provides an example of strongly asymmetrical array which preserves this property in case of deletion of a few columns , rows and points .
validation of the tma design and the wsi match ( a ) is a graphic rendering of the two properties set forth before analyzing the match between the tma design and the wsi ; ( b ) represents the four possible isometric alignments of the tma design and the wsi , only one of which represents the identity of both the implementation of a barcode - driven error control of the design and execution of a tma for patient diagnosis requested approximately  4,000.00 to modify the lis program , in order to print the slide i d as a linear barcode in addition to the customary alphanumeric identifiers .
the generation of the query to extract from the lis a sample data by barcode scanning costs approx .
the modification of the aperio spectrum segmentation interface to match the ids on the slide and in the database was part of this project .
the speed of the tma construction and the workflow did not change apparently after the implementations were put in place , mostly because of the deep automation already in place ; it actually gained speed and smoothness of operation by leaving to the machine the tedious but necessary task of sample checking .
we took a mathematical approach to the question on how to validate matching the grid containing the patient 's i d and data ( the tma construction design ) with the image of the tma stained section .
( intuitively , it has no nontrivial isometries ) , provided it satisfies two , easy to check , conditions .
we set the following standard notation :  is the real line ,  the plane    endowed by the euclidean distance , [ a , b ] is the straight segment from the point a to the point b in . we prove the following statement : let r be a finite , hence discrete , set of points in  , such that the two following two properties hold . 

let lpq be the line through the points p , q ; consider the set s of all the segments [ p , q ] , p , q  r with the property that one of the two connected components of   lpq has empty intersection with . then we require the existence of a segment [ a , b ]  s whose length is unique among the lengths of the other segments in s.let [ a , b ] , a , b  r be the unique segment of length n in s. then r should not be symmetrical with respect to the axis perpendicular to [ a , b ] through its midpoint . 
 
let lpq be the line through the points p , q ; consider the set s of all the segments [ p , q ] , p , q  r with the property that one of the two connected components of   lpq has empty intersection with . then we require the existence of a segment [ a , b ]  s whose length is unique among the lengths of the other segments in s. let [ a , b ] , a , b  r be the unique segment of length n in s. then r should not be symmetrical with respect to the axis perpendicular to [ a , b ] through its midpoint .
then if  :    is an isometry such that  ( r)= r ,  must be the identity function .
we recall than an isometry in  is a function f such that de(x , y)=de(f(x ) , f(y ) ) for all ( x , y )   , where de is the euclidean distance in . they include ( and are in fact generated by ) all reflections , rotations and translations .
this statement is false if we require  to be a homeomorphism ( i.e. bijective and bicontinuous function ) only .
proof : being  an isometry , it sends lines in lines , thus  ( [ a , b ] ) is a segment connecting the two points  ( a ) and  ( b ) in r. because of the continuity of  , there exists a connected component of  l(a)(b ) with empty intersection with r , since so does   lab .
therefore [  ( a ) ,  ( b ) ] belongs to the set s , as we are assuming (r)=r .
the length of such a segment must be the same as the length of [ a , b ] , again because  is an isometry . by the unicity of the segments in s of length n ( condition ( 1 ) on r ) , it must be [  ( a ) ,  ( b ) ] = [ a , b ] and  restricted to [ a , b ] is an isometry onto [ a , b ]
. either of the following cases must necessarily happen : 
  ( a ) = a and  ( b ) = b. then  restricted to the line lab is an isometry onto lab itself that fixes two points , therefore it must be the identity on the same line .
this leaves only one non trivial possibility for  as map on  : a reflection along the lab axis .
but in that case , it is impossible that  ( r ) = r , since  would swap the connected components of  lab and the points in r not in lab are all contained in one component .
this leaves  = identity on the whole plane  as the only possibility. ( a ) = b and  ( b ) = a. then  must have at least a fixed point , which must necessarily be the middle point m of [ a , b ] since  is assumed to be an isometry . thus it must either be a rotation by  around m , in which case  ( r )  r because  swaps the connected components of  lab , or else a reflection through the line perpendicular to [ a , b ] through m. however , the condition ( 2 ) on r implies that  ( r )  r for such an isometry . 
 
 ( a ) = a and  ( b ) = b. then  restricted to the line lab is an isometry onto lab itself that fixes two points , therefore it must be the identity on the same line .
this leaves only one non trivial possibility for  as map on  : a reflection along the lab axis .
but in that case , it is impossible that  ( r ) = r , since  would swap the connected components of  lab and the points in r not in lab are all contained in one component .
 ( a ) = b and  ( b ) = a. then  must have at least a fixed point , which must necessarily be the middle point m of [ a , b ] since  is assumed to be an isometry . thus it must either be a rotation by  around m ,
in which case  ( r )  r because  swaps the connected components of  lab , or else a reflection through the line perpendicular to [ a , b ] through m. however , the condition ( 2 ) on r implies that  ( r )  r for such an isometry .
this shows that the only possible isometry  of  such that  ( r ) = r is the identity function .
think of an array of specimens placed in glass slide as the finite set r satisfying the conditions ( 1 ) and ( 2 ) .
assume the shape of the slide to be unknown and that the array is placed randomly on it .
this result implies that , choosing any labelling of the specimens and applying an unknown sequence of integrity - preserving transformations to the slide , to recover the initial labelling of the specimens it suffices to move the slide around until the shape of the array matches the original one .
the conditions ( 1 ) and ( 2 ) are isometry invariant , meaning that , they hold for a set r if and only if they hold for  ( r ) , where  is any isometry of . as a consequence , the array of specimens , when glued on the slide , will be strongly asymmetrical , provided the initial ( computer generated ) one was and all the processing involved in the slide preparation can be assumed to transform the array only just through isometries . the easiest examples of lattices satisfying the conditions ( 1 ) and ( 2 ) are rect - angular ones with sides lengths c  d with an extra specimen added in a length c boundary row .
for that array we can take n to be c + 1 and immediately verify that the conditions are fulfilled . appropriately removing blocks of points from one corner of a rectagular array , with sufficiently many rows and columns ,
provides an example of strongly asymmetrical array which preserves this property in case of deletion of a few columns , rows and points .
validation of the tma design and the wsi match ( a ) is a graphic rendering of the two properties set forth before analyzing the match between the tma design and the wsi ; ( b ) represents the four possible isometric alignments of the tma design and the wsi , only one of which represents the identity of both
the implementation of a barcode - driven error control of the design and execution of a tma for patient diagnosis requested approximately  4,000.00 to modify the lis program , in order to print the slide i d as a linear barcode in addition to the customary alphanumeric identifiers .
the generation of the query to extract from the lis a sample data by barcode scanning costs approx .
the modification of the aperio spectrum segmentation interface to match the ids on the slide and in the database was part of this project .
the speed of the tma construction and the workflow did not change apparently after the implementations were put in place , mostly because of the deep automation already in place ; it actually gained speed and smoothness of operation by leaving to the machine the tedious but necessary task of sample checking .
the focus of our work is on areas which have been taken as granted or obvious and therefore not scientifically investigated such as asymmetry of the design , requirements of the tma design layout , matching of the design with the image and validation of the correspondence between data and image for individual spots .
we have sought to control and minimize the source of i d errors through the process .
this aspect has not been addressed before because of the high data yield achievable with the tma technique , with reduces the impact of sample heterogeneity ( and for that matter , switching individual samples ) on the significance of the results within large cohorts of patients .
switching individual samples or patients has little bearing if one looks e.g. at the impact of a phenotype on prognosis , particularly if no clinical decisions have to be made on each and every single patient within that cohort . to obtain error control
we have used barcode readings throughout the entire process [ figure 1 ] . scanning a linear barcode
is not error - free , however it considerably reduces the source of keystroke errors .
random placement of core replicas within the tma , a recommended practice , requires a compact design .
this makes redundant the use of sectors , introduced both to shape the asymmetry and to facilitate the visual identification of different groups of samples within the tma .
sectors use up tma space and do not necessarily guarantee asymmetry ( see examples in figure 2 ) .
the randomness of core placement further highlights the obligate handling of the tma on wsi scanners : traditional microscopes do not apply anymore .
one additional question we addressed was the validation of the correspondence between the i d and the image of individual cores , obtained upon matching the whole design geometry with the geometric matrix composed of core sections images .
we applied the laws of geometry , which states that once the vectorial transformation of an intrinsically asymmetric matrix ( e.g. , the wsi ) is coincident with another given matrix ( e.g. , the tma design ) the vector pointing to an individual component has the same value , thus the points coincide and the i d of each and every component is validated .
a graphic rendering of the grid , which includes lines connecting all the individual positions in the grid , is of paramount importance to verify the isometries while adapting the grid upon the tma image .
there are other issues which we did not address ; one is the amount of human intervention needed during the segmentation ( or  de - arraying  ) procedure and the efficiency required .
this issue has been examined by a handful of papers , one of which , compares a custom made de - arraying system with the one which has been used for the present study .
however , equivocal placement of individual cores may still be judged by a human eye .
another issue we did not solve is how and where a robust asymmetry should be enforced during the process .
our feeling is that asymmetry is too important for safely identify individual samples / patients and that it should be enforced at some point .
one last non - preventable source of analytical error may occur when the combination of loss of cores from the periphery of the section and the deformation of the paraffin sheet upon collecting the section from the water bath results in an equivocal assignment of a core to a row or a line .
if each sample is represented twice or three times within the tma , there should be no loss of analysis for that specimen .
lastly , whether is done automatically or under human supervision , the asymmetry of the design should be visible in the grid superimposed to the wsi before segmenting . ideally , spots left empty for the asymmetry should be automatically recognized as an additional safeguard against matching the wrong grid with the wrong wsi .
we have applied for the first time a scientific approach to the i d error control to the construction and data analysis with the tma technology , we have validated the process of identifying the wsi of single samples / patients in the tma , setting diagnostic standards for the use of the tma .
while all these aspects seem redundant for the research use of the tma technology , they are mandatory for any use of it which involves patient 's care . however
, controlling for analytical errors in experiments in science and industry is a golden standard and we advocate the use of our solutions in all fields using the tma high throughput technology .
 context : in 2013 the high throughput technology known as tissue micro array ( tma ) will be fifteen years old . 
 its elements ( design , construction and analysis ) are intuitive and the core histopathology technique is unsophisticated , which may be a reason why has eluded a rigorous scientific scrutiny . the source of errors , particularly in specimen identification and how to control for it is unreported 
 . formal validation of the accuracy of segmenting ( also known as de - arraying ) hundreds of samples , pairing with the sample data is lacking.aims:we wanted to address these issues in order to bring the technique to recognized standards of quality in tma use for research , diagnostics and industrial purposes.results:we systematically addressed the sources of error and used barcode - driven data input throughout the whole process including matching the design with a tma virtual image and segmenting that image back to individual cases , together with the associated data . 
 in addition we demonstrate on mathematical grounds that a tma design , when superimposed onto the corresponding whole slide image , validates on each and every sample the correspondence between the image and patient 's data.conclusions:high throughput use of the tma technology is a safe and efficient method for research , diagnosis and industrial use if all sources of errors are identified and addressed . 