Conference Papers
Permanent URI for this collectionhttps://idr.nitk.ac.in/handle/123456789/28506
Browse
2 results
Search Results
Item Determination of sequences responsible for generation of a sequence(IEEE Computer Society, 2008) Navada, K.C.; Chandra Sekaran, K.; Geetha, M.For the construction of a phylogenetic network, it is essential to know if the new sequence that is being inserted is the result of mutations or due to events like recombinations. Recombination is a process of formation of new genetic sequences by piecing together segments of previously existing sequences [1][2], Once it is determined that it is a recombination process, it is then necessary to determine the number of recombinations required for the generation of this sequence[4], This is because, in certain cases more than one recombination event are necessary. Here we propose an algorithm which determines the sequences already existing in the network that are likely to be responsible for the creation of the given sequence. © 2007 IEEE.Item A dynamic approach for discovering maximal frequent itemsets(2009) Geetha, M.; D'Souza, R.J.We present a novel method, which reads the database at regular intervals as in Dynamic Itemsets Counting Technique and creates a tree called Dynamic Itemset Tree containing items which may be frequent, potentially frequent and infrequent. This algorithm requires less time to discover all maximal frequent itemsets since it involves a method for reducing the size of the database. This method prunes the transactions and items of the transactions which are not of our interest after every scan of the database. Also, this method is independent of the order of the items. © 2009 IEEE.