Result 1 to 20 of 20 total
Identifying SNPs without a reference genome by comparing raw reads. (English)
Chavez, Edgar (ed.) et al., String processing and information retrieval. 17th international symposium, SPIRE 2010, Los Cabos, Mexico, October 11‒13, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16320-3/pbk). Lecture Notes in Computer Science 6393, 147-158 (2010).
1
An optimized filter for finding multiple repeats in DNA sequences (English)
AICCSA, 1-8 (2010).
2
Identifying SNPs without a reference genome by comparing raw reads (English)
SPIRE, 147-158 (2010).
3
In-place update of suffix array while recoding words. (English)
Int. J. Found. Comput. Sci. 20, No. 6, 1025-1045 (2009).
4
c-GAMMA:Comparative genome analysis of molecular markers. (English)
Kadirkamanathan, Visakan (ed.) et al., Pattern recognition in bioinformatics. 4th IAPR international conference, PRIB 2009, Sheffield, UK, September 7‒9, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04030-6/pbk). Lecture Notes in Computer Science 5780. Lecture Notes in Bioinformatics, 255-269 (2009).
5
Lossless filter for multiple repeats with bounded edit distance (English)
Algorithms for Molecular Biology 4 (2009).
6
C-GAMMA: comparative genome analysis of molecular markers (English)
PRIB, 255-269 (2009).
7
Lossless filter for multiple repetitions with Hamming distance. (English)
J. Discrete Algorithms 6, No. 3, 497-509 (2008).
8
Indexing gapped-factors using a tree. (English)
Int. J. Found. Comput. Sci. 19, No. 1, 71-87 (2008).
9
Protein similarity search with subset seeds on a dedicated reconfigurable hardware. (English)
Wyrzykowski, Roman (ed.) et al., Parallel processing and applied mathematics. 7th international conference, PPAM 2007, Gdansk, Poland, September 9‒12, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-68105-2/pbk). Lecture Notes in Computer Science 4967, 1240-1248 (2008).
10
In-place update of suffix array while recoding words (English)
Stringology, 54-67 (2008).
11
Protein similarity search with subset seeds on a dedicated reconfigurable hardware (English)
PPAM, 1240-1248 (2007).
12
Application of suffix trees for the acquisition of common motifs with gaps in a set of strings (English)
LATA, 57-66 (2007).
13
Finding common motifs with gaps using finite automata. (English)
Ibarra, Oscar H. (ed.) et al., Implementation and application of automata. 11th international conference, CIAA 2006, Taipei, Taiwan, August 21‒23, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-37213-4/pbk). Lecture Notes in Computer Science 4094, 69-77 (2006).
14
The gapped-factor tree (English)
Stringology, 182-196 (2006).
15
Finding common motifs with gaps using finite automata (English)
CIAA, 69-77 (2006).
16
Lossless filter for finding long multiple approximate repetitions using a new data structure, the bi-factor array. (English)
Consens, Mariano (ed.) et al., String processing and information retrieval. 12th international conference, SPIRE 2005, Buenos Aires, Argentina, November 2‒4, 2005. Proceedings. Berlin: Springer (ISBN 978-3-540-29740-6/pbk). Lecture Notes in Computer Science 3772, 179-190 (2005).
17
A first approach to finding common motifs with gaps. (English)
Int. J. Found. Comput. Sci. 16, No. 6, 1145-1154 (2005).
18
Lossless filter for finding long multiple approximate repetitions using a new data structure, the bi-factor array (English)
SPIRE, 179-190 (2005).
19
A first approach to finding common motifs with gaps (English)
Stringology, 88-97 (2004).
20
Result 1 to 20 of 20 total
Start
Contact
Print
General Help
