Modern Information Retrieval
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Visual Web Information Extraction with Lixto
Proceedings of the 27th International Conference on Very Large Data Bases
A Faster Algorithm for Approximate String Matching
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
A Fast Algorithm on Average for All-Against-All Sequence Matching
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Multi-resolution disambiguation of term occurrences
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
The effects of word order and segmentation on translation retrieval performance
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
Rapid and sensitive dot-matrix methods for genome analysis
Bioinformatics
A study for comparative evaluation of the methods for image processing using texture characteristics
WSEAS Transactions on Information Science and Applications
WSEAS Transactions on Information Science and Applications
Mining long high utility itemsets in transaction databases
WSEAS Transactions on Information Science and Applications
Extended gloss overlaps as a measure of semantic relatedness
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
An integrated statistical comparative analysis between variant genetic datasets of Mus musculus
International Journal of Computational Intelligence in Bioinformatics and Systems Biology
Clustering genome data based on approximate matching
International Journal of Data Analysis Techniques and Strategies
| Hi-index | 0.00 |
Genetic Sequences of different species contain precious biological information. This information is hidden in the order of appearing nucleotide base characters (A-Adenine, T-Thymine, G-Guanine and C-Cytosine), this order is definitely variant in different organisms but one can conclude some of the similarities and differences in nature, habits and living of species by comparing the biological information contained in sequence. In this paper, we are presenting an algorithm that provides approximate comparative match between any input strands. It will overcome the draw backs and short comings in prevailing techniques. It becomes most difficult to find approximate match when Genome Adoptive Points (GAPS) are present in the input sequences, this algorithms tries to handle the complex situations and finds the number of approximate matches for optimal results.