RISOTTO: Fast Extraction of Motifs with Mismatches

DOI10.1007/11682462_69MaRDI QIDQ3525809zbMATH OpenOpenAlexFDO

Authors Nadia Pisanti, Alexandra M. Carvalho, Laurent Marsan, Marie-France Sagot

Publication date 18 September 2008

Published in LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11682462_69

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Optimal Offline Extraction of Irredundant Motif Bases
• Optimal extraction of irredundant motif bases
• Finding motifs based on suffix trie
• Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time
• String Processing and Information Retrieval

Cited in

(11)

• Fast algorithm for extracting multiple unordered short motifs using bit operations
• scientific article; zbMATH DE number 1945160 (Why is no real title available?)
• Incremental discovery of the irredundant motif bases for all suffixes of a string in \(O(n^2\log n)\)time
• Optimal extraction of irredundant motif bases
• Suffix tree characterization of maximal motifs in biological sequences
• Finding motifs based on suffix trie
• A multi-objective imperialist competitive algorithm (MOICA) for finding motifs in DNA sequences
• Optimal Offline Extraction of Irredundant Motif Bases
• An improved voting algorithm for planted \((l, d)\) motif search
• Extracting string motif bases for quorum higher than two
• String Processing and Information Retrieval

Describes a project that uses

Uses Software

• RISOTTO

This page was built for publication: RISOTTO: Fast Extraction of Motifs with Mismatches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3525809)