Each reported alignment carries several numbers. The raw score S adds match, mismatch and gap scores, so it depends on the matrix used. The bit score rescales S so scores from different scoring systems can be compared. The E-value is the number of hits at least this good you would expect by chance in a search of this size.
PERCENT IDENTITY
identity=100×alignment lengthidentical aligned pairs
The alignment length counts every column, including gaps. It does not say how unlikely the match is, so it cannot replace the E-value.
Read percent identity off the alignment rows. Both rows are written 5' to 3', as all sequences here are, and a dash is a gap.
query ACGTTGCA-T
hit ACGATGCAGT
There are 10 columns. Eight hold the same base in both rows; column 4 is a mismatch and column 9 a gap. Identity = 100 × 8 ÷ 10 = 80%. Yet so few columns give a small raw score, so a small bit score, and E=mN2−S′ stays large.
E is counted per search. A cut-off of 0.001 lets through, on average, 0.001 chance hits per search: about one in a thousand searches. Loosen it to 10 to see weak relatives, and expect about 10 chance hits per search among them. Tighten it to 10−10 to keep only very strong matches, and miss weaker true relatives. The right value depends on whether a missed relative or a false lead costs you more.