Author of the publication

Characterization and Extraction of Irredundant Tandem Motifs.

, , and . SPIRE, volume 7608 of Lecture Notes in Computer Science, page 385-397. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Efficient in silico Chromosomal Representation of Populations via Indexing Ancestral Genomes., , , , , and . Algorithms, 6 (3): 430-441 (2013)Host Phenotype Prediction from Differentially Abundant Microbes Using RoDEO., , and . CIBB, volume 10477 of Lecture Notes in Computer Science, page 27-41. Springer, (2016)A PQ Framework for Reconstructions of Common Ancestors and Phylogeny.. Comparative Genomics, volume 4205 of Lecture Notes in Computer Science, page 141-155. Springer, (2006)An Output-Sensitive Flexible Pattern Discovery Algorithm., , and . CPM, volume 2089 of Lecture Notes in Computer Science, page 131-142. Springer, (2001)Sequents, barcodes, and homology., , and . CoRR, (2022)Essential Simplices in Persistent Homology and Subtle Admixture Detection., , and . WABI, volume 113 of LIPIcs, page 14:1-14:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)10231 Abstracts Collection - Structure Discovery in Biology: Motifs, Networks & Phylogenies., , and . Structure Discovery in Biology: Motifs, Networks & Phylogenies, volume 10231 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)Compression and the Wheel of Fortune., and . DCC, page 143-152. IEEE Computer Society, (2003)Bridging Lossy and Lossless Compression by Motif Pattern Discovery., , and . GTIT-C, volume 4123 of Lecture Notes in Computer Science, page 793-813. Springer, (2006)A Combinatorial Approach to Automatic Discovery of Cluster-Patterns., , and . WABI, volume 2812 of Lecture Notes in Computer Science, page 139-150. Springer, (2003)