Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
Panagiotis D. Michailidis, Konstantinos G. Margari...
ClustalW is the most widely used tool for aligning multiple protein or nucleotide sequences. The alignment is achieved via three stages: pairwise alignment, guide tree generation ...
K. Chaichoompu, Surin Kittitornkun, Sissades Tongs...
Analysis of the spacial structure of proteins including folding processes is a challenge for modern bioinformatics. Due to limited experimental access to folding processes, comput...
Sebastian Potzsch, Gerik Scheuermann, Peter F. Sta...
Abstract— Comparing genetic sequences is a well-known problem in bioinformatics. Newly determined sequences are being compared to known sequences stored in databases in order to ...
Philippe Faes, Bram Minnaert, Mark Christiaens, Er...
The most controversial part of genetic programming is its highly disruptive and potentially innovative subtree crossover operator. The clearest problem with the crossover operator...