Thermostable and alkalitolerant xylanases have got intense research focus due to their vast applications in various industries including pulp and paper, food, feed, textile, biofuel, etc. In the present investigation, a Penicillum sp. SS1 isolated from degrading woody material was found to produce moderately thermoactive and alkalistable endo-β-1,4-xylanase (xylanase). Maximum xylanase production was observed after fourth day of fermentation (43.84 IU/ml). The organism produced substantial quantities of xylanase using agricultural residues like wheat bran (20.6 IU/ml), rice bran (21.8 IU/ml) and sawdust (10.7 IU/ml) as carbon sources. The enzyme preparation was totally free of filter paper activity (FPase) and possessed negligible carboxymethyl cellulase (CMCase) activity; this could be an important feature of enzyme if the intended application of enzyme is in pulp and paper industries. Among nitrogen sources examined, yeast extract supported maximum xylanase production (45.74 IU/ml), and was followed by soybean meal (22.2 IU/ml) and ammonium sulphate (20 IU/ml). Maximum xylanase production was observed at initial medium pH 9 (25.6 IU/ml); however, at pH 8 and 10 also significantly high enzyme titre was observed (24 and 21.2 IU/ml, respectively). Thus, Penicillium sp. SS1 displayed capability of growing and producing xylanase at high alkaline pH (8–10). Maximum xylanase activity was reported at 50 °C, however, significantly high activity was observed at 60 °C (65.4%), however, at 70–80 °C activity was lost considerably. At 50–60 °C the enzyme retained very high activity up to 30–60 min (91–100%), however, prolonged incubation (90 min) caused considerable activity reduction (residual activity 63–68%).
The efficient finding of common patterns: a group of items that appear frequently in a dataset is a critical task in data mining, especially in transaction datasets. The goal of this paper is to look into the efficiency of various algorithms for frequent pattern mining in terms of computing time and memory consumption, as well as the problem of how to apply the algorithms to different datasets. In this paper, the algorithms investigated for mining the frequent patterns are; Pre-post, Pre-post+, FIN, H-mine, R-Elim, and estDec+ algorithms. These algorithms have been implemented and tested on four real-life datasets that are: The retail dataset, the Accidents dataset, the Chess dataset, and the Mushrooms dataset. From the results, it has been observed that, for the Retail dataset, estDec+ algorithm is the fastest among all algorithms in terms of run time as well as consumes less memory for its execution. Pre-post+ algorithm performs better than all other algorithms in terms of run time and maximum memory for the Mushrooms dataset. Pre-Post outperforms other algorithms in terms of performance. And for Accident datasets, in terms of execution time and memory consumption, the FIN method outperforms other algorithms.