51 search results - page 5 / 11 » A DNA Sticker Algorithm for Solving N-Queen Problem |
AAIM
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
ARC
2008
Springer
14 years 11 months ago
2008
Springer
Reconfigurable architectures enable the hardware function to be implemented by the user and, due to its characteristics, have been used in many areas, including Bioinformatics. One...
BMCBI
2008
14 years 9 months ago
2008
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
TCS
2008
14 years 9 months ago
2008
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
GCB
2006
Springer
15 years 1 months ago
2006
Springer
: Despite many years of research on how to properly align sequences in the presence of sequencing errors, alternative splicing and micro-exons, the correct alignment of mRNA sequen...