Sciweavers

166 search results - page 9 / 34
» Suffix trees for very large genomic sequences
Sort
View
FSTTCS
2003
Springer
15 years 5 months ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...
TASLP
2010
106views more  TASLP 2010»
14 years 6 months ago
Efficient and Robust Music Identification With Weighted Finite-State Transducers
We present an approach to music identification based on weighted finite-state transducers and Gaussian mixture models, inspired by techniques used in large-vocabulary speech recogn...
Mehryar Mohri, Pedro Moreno, Eugene Weinstein
TCS
2008
14 years 11 months ago
A small trip in the untranquil world of genomes: A survey on the detection and analysis of genome rearrangement breakpoints
Genomes are dynamic molecules that are constantly undergoing mutations and rearrangements. The latter are large scale changes in a genome organisation that participate in the evol...
Claire Lemaitre, Marie-France Sagot
BMCBI
2007
106views more  BMCBI 2007»
14 years 11 months ago
Simultaneous identification of long similar substrings in large sets of sequences
Background: Sequence comparison faces new challenges today, with many complete genomes and large libraries of transcripts known. Gene annotation pipelines match these sequences in...
Jürgen Kleffe, Friedrich Möller, Burghar...
BMCBI
2010
129views more  BMCBI 2010»
14 years 11 months ago
Geoseq: a tool for dissecting deep-sequencing datasets
Background: Datasets generated on deep-sequencing platforms have been deposited in various public repositories such as the Gene Expression Omnibus (GEO), Sequence Read Archive (SR...
James Gurtowski, Anthony Cancio, Hardik Shah, Chay...