Files
obitools4/pkg/obisimilarity/table4_simd.go
T
Eric Coissac e511650f5b Refactor similarity engine and implement parallel clustering
Introduces parallel processing for clustering, refines scoring mechanisms, and expands test coverage for the alignment functionality.

This change introduces parallel processing capabilities within the clustering logic, updates the core similarity engine with new data structures and scoring methods, and implements a comprehensive test suite for the alignment tool. It also adds new command-line options for configuring alignment parameters and reference lengths.
2026-11-03 14:04:32 +11:00

36 lines
1.1 KiB
Go

//go:build goexperiment.simd
package obisimilarity
import "simd"
// commonWords is the upper bound used for the number of 4-mers shared by two
// sequences: the sum of the minima of the counters, plus the minimum of the
// two overflows.
//
// The minima of the 256 counters are computed by vectors of bytes, and summed
// in 16-bit lanes (at most 256*255 spread over the lanes, the lanes being at
// least 8 in number, so that none of them overflows).
func commonWords(t1, t2 *Table4) int {
var probe simd.Uint8s
vl := probe.Len()
acc := simd.BroadcastUint16s(0)
low := simd.BroadcastUint16s(0x00FF)
for i := 0; i < len(t1.Count); i += vl {
m := simd.LoadUint8s(t1.Count[i:]).Min(simd.LoadUint8s(t2.Count[i:])).ReshapeToUint16s()
acc = acc.Add(m.And(low)).Add(m.ShiftAllRight(8))
}
// sum the pairs of 16-bit lanes into 32-bit lanes, then add those up
wide := acc.ReshapeToUint32s()
sums := wide.And(simd.BroadcastUint32s(0xFFFF)).Add(wide.ShiftAllRight(16))
var lanes [32]uint32
sums.Store(lanes[:])
total := 0
for _, v := range lanes[:sums.Len()] {
total += int(v)
}
return total + min(t1.Overflow, t2.Overflow)
}