Skip to main content
. 2009 Feb;16(2):145–157. doi: 10.1089/cmb.2008.02TT

Table 1.

Running Time of Our Algorithm with Different Parameters (Time Measured in Seconds)

 
 
Query path length
Maximum no. of insertions No. of paths 6 8 10 12 14 16 18 20
D = 0 k = 1 47.9 67.5 85.8 105.4 122.6 144.0 163.6 179.2
D = 5 k = 5 1373.4 1878.3 2382.4 2881.5 3384.4 3894.5 4387.5 4817.5